翻转连表

package linkedlist;

/**
 * Created by lijie35 on 2020-01-17 5:04 PM .
 */
public class ReverseNode {
    public static void main(String[] args) {
        System.out.println();

        Node node = new Node(1);
        Node node1 = new Node(2);
        node1.next = node;
        Node node2 = new Node(3);
        node2.next = node1;
        Node node3 = new Node(4);
        node3.next = node2;
        System.out.println(node3);

        reverse(node3);

    }

    /**
     * 4>3>2>1
     * Node{next=Node{next=Node{next=Node{next=null, val=1}, val=2}, val=3}, val=4}
     * Node{next=Node{next=Node{next=Node{next=null, val=4}, val=3}, val=2}, val=1}
     */
    public static void reverse(Node node) {
        //指针指向头部
        Node dummy = new Node(-1);

        while (node != null) {

            //临时持有当前节点的下一个节点
            Node next= node.next;
            //插入节点的下个节点时dummy的节点
            node.next=dummy.next;
            //指针指向插入节点
            dummy.next = node;
            //当前接点的下一个节点赋值给当前节点
            node =  next ;
        }

        System.out.println(dummy.next);


    }

}

Node

package linkedlist;

public class Node {

    Node next;

    int val;


    public Node(int val) {
        this.val = val;
    }

    @Override
    public String toString() {
        return "Node{" +
                "next=" + next +
                ", val=" + val +
                '}';
    }
}