LeetCode 206. Reverse Linked List
Reverse a singly linked list.
Example:
Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL
Follow up:
A linked list can be reversed either iteratively or recursively. Could you implement both?
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
/*ListNode *pre=NULL, *cur = head;
while(cur){
ListNode *nex=cur->next;
cur->next=pre;
pre=cur;//move back
cur = nex;
}
return pre;*/
if(!head || !head->next)// it could be empty list.
return head;
ListNode *res = reverseList(head->next);
head->next->next = head;//reverse
head->next = NULL;
return res;
}
};