Reverse a linked list without using new in java

reverse.java

public static Node reverse(Node list) {

    Node n;
    Node head;

    if (list == null) {
        return null;
    }

    head = list;
    n = list;
    while (n != null) {
        list = list.next;

        if (n == head) {
            n.next = null;
        } else {
            n.next = head;
        }

        head = n;
        n = list;
    }
    
    return head;
}