反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题?
解答:
/**
* 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 *dummy = new ListNode();
dummy->next = head;
ListNode *pre = NULL,*t = NULL,*p = dummy->next;
while(p->next!=NULL){
t = p->next;
p->next = pre;
pre = p;
p = t;
}
p->next = pre;
return p;
}
};