[swift] LeetCode 206. Reverse Linked List

Reverse a singly linked list.

func reverseList(_ head: ListNode?) -> ListNode? {
    var stack = [Int](), p = head
    while let t = p {
        stack.append(t.val)
        p = t.next
    }
    p = head
    while let t = p {
        t.val = stack.popLast()!
        p = t.next
    }
    return head
}

func reverseList(_ head: ListNode?) -> ListNode? {

var stack = [Int](), p = head

while let t = p {

stack.append(t.val)

p = t.next

}

p = head

while let t = p {

t.val = stack.popLast()!

p = t.next

}

return head

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版