[leetcode]206. Reverse Linked List
Analysis
很久没有这么讨厌一个人了!—— [holy shit~]
Reverse a singly linked list.
链表反转,我是直接反转的,还可以用递归法。
Implement
/**
* 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* p;
ListNode* q;
if(head == NULL || head->next == NULL)
return head;
p = head->next;
while(p->next){
q = p->next;
p->next = q->next;
q->next = head->next;
head->next = q;
}
p->next = head;
head = p->next->next;
p->next->next = NULL;
return head;
}
};