牛客网刷题(JAVA) 17：反转链表

难度系数 ⭐

时间限制 C/C++ 1秒，其他语言2秒 空间限制：C/C++ 32M，其他语言64M

题目内容 输入一个链表，反转链表后，输出新链表的表头。

思路 设置两个指示指针pre和pos。可以理解为pre.next指向head头节点，head.next指向pos，利用三个指针的位置关系进行反转。画个图思路就明显了。

package nowcoder;

public class No18 {
    public static class Node{
        public int value;
        public Node next;

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

    public static Node ReverseList(Node head){
        if (head == null) return null;
        if (head.next == null) return head;

        Node pre = null;
        Node pos = head.next;

        while (head != null){
            head.next = pre;
            pre = head;
            head = pos;
            if (pos != null) pos = pos.next;
        }
        return pre;
    }

    public static void main(String[] args){
        Node head = new Node(1);
        head.next = new Node(2);
        head.next.next = new Node(3);
        head.next.next.next = new Node(4);
        head.next.next.next.next = new Node(5);

        Node flag = head;
        while (flag != null){
            System.out.print(flag.value + " ");
            flag = flag.next;
        }
        System.out.println();

        flag = ReverseList(head);
        while (flag != null){
            System.out.print(flag.value + " ");
            flag = flag.next;
        }
    }
}