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) {
if(head == NULL || head->next == NULL)return head;
ListNode *tmp_head = new ListNode(0), *p = head, *q = head, *tmp;
tmp_head->next = head;
while(p->next)
{
tmp = p->next;
p->next = p->next->next;
tmp->next = tmp_head->next;
tmp_head->next = tmp;
}
return tmp_head->next;
}
};