Reverse linked list drawing demonstration

subject

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

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; } * } */
class Solution {
    
    public ListNode reverseList(ListNode head) {
    

    }
}

Answer key

class Solution {
    
    public ListNode reverseList(ListNode head) {
    
        ListNode prev = null;
        ListNode curr = head;
        while (curr != null) {
    
            ListNode next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
}

 author ：LeetCode-Solution
 link ：https://leetcode.cn/problems/reverse-linked-list/solution/fan-zhuan-lian-biao-by-leetcode-solution-d1k2/
 source ： Power button （LeetCode）
 The copyright belongs to the author . Commercial reprint please contact the author for authorization , Non-commercial reprint please indicate the source .

Drawing demonstration