【编程练习】单链表逆序Java实现

public class LinkedListReverse {

static class ListNode{
int data;
ListNode next;
public ListNode(int data){
this.data = data;
}
}

public static ListNode reverse(ListNode head){
if (head == null){
return null;
}
ListNode cur = head;
ListNode oldHead = null;
ListNode newHead = null;
while(cur != null){
oldHead = cur.next;
cur.next = newHead;
newHead = cur;
cur = oldHead;
}

return newHead;
}

public static void main(String[] args) {
// 测试
ListNode node1 = new ListNode(1);
ListNode node2 = new ListNode(2);
ListNode node3 = new ListNode(3);
node1.next = node2;
node2.next = node3;
ListNode head = new ListNode(0);
head = reverse(node1);
System.out.print(head.data+" "+head.next.data+" "+head.next.next.data);
}

}