定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
解题思路:
断链+头插法
代码:
/**
* 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, * q, * s, * t, * pre;
if(head == NULL) return head;
if(head -> next == NULL) return head;
p = head -> next;
head -> next = NULL;
while(p){
q = p -> next;
p -> next = head -> next;
head -> next = p;
p = q;
}
s = head -> next;
head -> next = NULL;
t = s;
while(t){
pre = t;
t = t -> next;
}
pre->next = head;
return s;
}
};