LeetCode-Golang之【206. 反转链表】

反转一个单链表。

题解

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func reverseList(head *ListNode) *ListNode {
    var pre *ListNode
    for head !=nil {
        tmp :=head.Next
        head.Next = pre
        pre = head
        head = tmp
    }
    return pre
}