【Leetcode】206. 反转链表

【Leetcode】206. 反转链表

代码

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