206. Reverse Linked List, Leet Code solution

206_Reverse Linked List_LeetCode.cs

public class Solution {
    public ListNode ReverseList(ListNode head) {
        
        ListNode curr = head;
        ListNode prev = null;
        ListNode temp = null;

        while(curr != null)
        {
            temp = curr.next; // next value
            curr.next = prev; // Previous value
            prev = curr;
            curr= temp;
        }        
        return prev;
    }
}

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