反转链表

2 = 1.next
1.next = 0
0 = 1
1 = 2

ListNode prev = null;
ListNode curr = head;
while(curr != null){
	ListNode next = curr.next;
	curr.next = prev;
	prev = curr;
	curr = next;
}
return prev;
}