链表反转

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

func reverseList(head *ListNode) *ListNode {
    var prev *ListNode
    curr := head
    for curr != nil {
        next := curr.Next
        curr.Next = prev
        prev = curr
        curr = next
    }
    return prev
}

1
2
3
4
5
6
7
8
9

func reverseList(head *ListNode) *ListNode {
  if head == nil || head.Next == nil {
    return head
  }
  newHead := reverseList(head.Next)
  head.Next.Next = head
  head.Next = nil
  return newHead
}