
Reverse a singly linked list.
Example:
1 2
|
Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
|
class { public ListNode reverseList(ListNode head) { ListNode prev = null; ListNode curr = head; while (curr != null) { ListNode temp = curr.next; curr.next = prev; prev = curr; curr = temp; } head = prev; return head; } }
|
近期评论