剑指offer第24题
https://leetcode.com/problems/reverse-linked-list/
1.非递归
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head==nullptr || head->next ==nullptr) return head;
ListNode *pre = head;
ListNode *next = head->next;
ListNode *tmp = nullptr;
pre->next = nullptr;
while(next!=nullptr){
tmp = next->next;
next->next= pre;
pre = next;
next = tmp;
}
return pre;
}
};
2.递归
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if (!head || !head->next) return head;
ListNode *newHead = reverseList(head->next);
head->next->next = head;
head->next = NULL;
return newHead;
}
};