Leetcode 206. reverse linked list I

This article is only an analytical record of personal problems encountered in question brushing , The questions and answers are on the official website ！！！

Reverse a linked list I
Reverse a linked list I：
Iterative method ：
Q1： What is the specific function of reversing the circular four statements of the linked list ？
A1：

while(curr != nullptr)
        {
    
            ListNode* next = curr->next;// This sentence records the next node of the current node .
            curr->next = prev;// Current node inversion , That is, the next node becomes its previous node 
            prev = curr;// Consider for the next point , Record the current node , Because the current node is the previous node after the inversion of the next node 
            curr = next;// Prepare for the next cycle , At this time, the current node changes . The next node of the original node 
        }