题目描述: 反转链表
代码:
/**
* 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* a,* b;
b = head->next;
a = b->next;
head->next = NULL;
while(b != NULL) {
b->next = head;
head = b;
b = a;
if(a!=NULL)a = a->next;
}
return head;
}
};
解题思路——递归:
传递两个相邻的节点参数,到底了就开始递归反转链表。
代码:
/**
* 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;
return f1(NULL, head);
}
ListNode* f1(ListNode* a, ListNode* b) {
if(b == NULL) return a;
ListNode* t = f1(b, b->next);
b->next = a;
return t;
}
};