入门级题解206. 反转链表

关键点：知道是让后一个指向前一个，但还是不知道具体实现
prev = [ ]
curr = 1 2 3 4 5
next = 2 3 4 5
curr = 1
//
prev = 1
curr = 2 3 4 5
next = 3 4 5
curr->next = prev curr = 2 1
prev = 2 1
curr = 3 4 5
//
next = 4 5
curr = 3 2 1
prev = 3 2 1
curr = 4 5
思路很简单，就是后一个指向前一个，关键1.指向前一个应该是独立节点，所以加->next = nullptr关键点2：在做->next = nullptr 之前，先要把->next保存下来
1 2 3 4 5
21 3 4 5
3 2 1 45
4 3 2 1 5

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* prev = nullptr;
        ListNode* curr = head;
        while (curr) {
            ListNode* next = curr->next;
            curr->next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
};

作者：LeetCode-Solution
链接：https://leetcode-cn.com/problems/reverse-linked-list/solution/fan-zhuan-lian-biao-by-leetcode-solution-d1k2/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。