Leetcode 206. reverse chain list (2022.07.25)

Here's the head node of the list head , Please reverse the list , And return the inverted linked list .

Example 1：

Input ：head = [1,2,3,4,5]
Output ：[5,4,3,2,1]
Example 2：

Input ：head = [1,2]
Output ：[2,1]
Example 3：

Input ：head = []
Output ：[]

Tips ：

The number range of nodes in the linked list is [0, 5000]
-5000 <= Node.val <= 5000

source ： Power button （LeetCode）

Method 1 ： iteration

C++ Submission ：

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;
    }
};