Reverse Linked List (easy)

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 static void main(String[] args) {

        ListNode head = new ListNode(1);
        ListNode cursor = head;
        for (int i = 2; i <= 5; i++) {
            ListNode nextNode = new ListNode(i);
            cursor.next = nextNode;
            cursor = nextNode;
        }
        printNode(head);
        printNode(reverseList(head));
    }

    public static void printNode(ListNode head) {
        while (head != null) {
            System.out.print(head.val + " ");
            head = head.next;
        }
        System.out.println();
    }

    public static ListNode reverseList(ListNode head) {
        //
    }

public static ListNode reverseList(ListNode head) {
    ListNode cursor = null;
    
    while (head != null) {
        ListNode nextNode = head.next;
        head.next = cursor;
        cursor = head;
        head = nextNode;
    }
    
    return cursor;
}