反转链表（就地反转） 力扣简单题

package com.doubleLinked;

public class ListNodeTest {
    public ListNode reserveNode(ListNode head){
        if(head == null){
            System.out.println("链表为空");
            return null;
        }
        ListNode newHead = null;
        while(head != null){
            ListNode next = head.next;

            head.next = newHead;

            newHead = head;

            head = next;
        }
        return newHead;
    }

    public void print2(ListNode head){
        ListNode temp = head;
        while (temp != null){
            System.out.println(temp.data +" ");
            temp = temp.next;
        }
    }

    public static void main(String[] args) {
        ListNode head1 = new ListNode(1);
        head1.next = new ListNode(2);
        head1.next.next = new ListNode(3);
        head1.next.next.next = new ListNode(4);
        ListNodeTest l2 = new ListNodeTest();
        l2.print2(head1);

        ListNode head2 = l2.reserveNode(head1);
        System.out.println();
        l2.print2(head2);
    }
}