算法 —— 反转单链表

反转单链表

定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点

public class Number24 {
    
   public Node reverseLinkedList(Node node) {
        Node pre = null;
        Node next = null;

        while (node != null){
            next = node.next;
            node.next = pre;
            pre = node;
            node = next;
        }
        return pre;
    }

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

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

    }
}