面试之-单链表反转

public class Lnode {
    int data;
    Lnode next;
}

public class TestNode {

    public static void main(String[] args){
        //一般头节点都不放东西
        Lnode node0 = new Lnode();
        Lnode node1 = new Lnode();
        Lnode node2 = new Lnode();
        Lnode node3 = new Lnode();
        Lnode node4 = new Lnode();
        node1.data = 1;
        node2.data = 2;
        node3.data = 3;
        node4.data = 4;
        node0.next = node1;
        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        Lnode test = test(node0);
        while (test!=null){
            System.out.println(test.data);
            test = test.next;
        }
    }

    private static Lnode test(Lnode node){
        Lnode head = null;
        Lnode next = node.next;
        while (next!=null){
          Lnode mid = next.next;
          next.next = head;
          head = next;
          next = mid;
        }
        return head;
    }
}