java链表反转

附代码：

public class LinkListReverse {
    void reverse(Node entry) {
        if (entry == null)
            return;
        Node currentNext = null,
        end = entry,
        Topnext = entry.next;
        while (Topnext != null) {
            end.next = currentNext;
            currentNext = end;
            end = Topnext;
            Topnext = Topnext.next;
        }
        end.next = currentNext;
        entry = end;
    }

    public static void main(String[] args) {
        LinkListReverse l = new LinkListReverse();
        Node t1=new Node();t1.i=1;

        Node t2=new Node();t2.i=2;

        Node t3=new Node();t3.i=3;
        t1.next=t2; t2.next=t3; t3.next=null;

        l.reverse(t1);
        System.out.println();
    }
}

class Node {
    int i;
    Node next;
}