206. Reverse Linked List
Reverse a singly linked list.
Example:
Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL
Follow up:
A linked list can be reversed either iteratively or recursively. Could you implement both?
func reverseList(head *ListNode) *ListNode {
var preNode *ListNode
curr := head
var nxt *ListNode
for curr != nil {
nxt = curr.Next
curr.Next = preNode
preNode = curr
curr = nxt
}
return preNode
}