您的位置:首页 > 其它

leetcode 206 Reverse Linked List(难易度:Easy)

2015-09-16 10:29 344 查看

Reverse Linked List

Reverse a singly linked list.

Hint:
A linked list can be reversed either iteratively or recursively. Could you implement both?

代码:

/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head) {
struct ListNode *pReversedHead = NULL;
struct ListNode *pNode = head;
struct ListNode *pPrev = NULL;
while (pNode != NULL) {
struct ListNode *pNext = pNode->next;
if (pNext == NULL)
pReversedHead = pNode;

pNode->next = pPrev;
pPrev = pNode;
pNode = pNext;
}
return pReversedHead;
}原题地址:https://leetcode.com/problems/reverse-linked-list/
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode