9.链表-翻转链表

/**

 * 翻转链表
 */
package facehandjava.Linked;

public class Reversal {
    public static void main(String[] args) {

        Node n6 = new Node(11,null);
        Node n5 = new Node(9, n6);
        Node n4 = new Node(7, n5);
        Node n3 = new Node(5, n4);
        Node n2 = new Node(3, n3);
        Node n1 = new Node(1, n2);
//       n6.setNext(n4);
        System.out.println("++++++++++++翻转前++++++++++++");
        Node now = n1;
        while (now!= null) {
            System.out.print(now.getVal()+",");
            now = now.getNext();
        }
        Node rev = Reversal(n1);
        System.out.println();
        System.out.println("++++++++++++翻转后++++++++++++");
        while (rev!= null) {
            System.out.print(rev.getVal()+",");
            rev = rev.getNext();
        }
    }

    public static Node Reversal(Node node) {
        Node pre = null;
        while (node!=null) {
            Node next =node.getNext();
            node.setNext(pre);
            pre = node;
            node = next;
        }
        return pre;
    }
}