单链表逆序

public class DANLIANBIAONIXU {
	public static Node reverse(Node head) {
		Node curnode = head;
		Node newnode = null;
		Node oldnode  = null;
		while(curnode != null) {
			oldnode = curnode.next;
			curnode.next = newnode;
			newnode = curnode;
			curnode = oldnode;
		}
		return newnode;
	}
	public static void main(String[] args) {
		Node node1 = new Node(1);
		Node node2 = new Node(2);
		Node node3 = new Node(3);
		Node node4 = new Node(4);
		Node node5 = new Node(5);
		
		node1.next = node2;
		node2.next = node3;
		node3.next = node4;
		node4.next = node5;
		
		Node temp = reverse(node1);
		
		while(temp != null) {
			System.out.println(temp.data);
			temp = temp.next;
		}
		
	}
}