Leetcode206-反转链表

 public class ListNode {
     public var val: Int
     public var next: ListNode?
     public init() { self.val = 0; self.next = nil; }
     public init(_ val: Int) { self.val = val; self.next = nil; }
     public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }
 }
class Solution {
    //反转链表
    func reverseList(_ head: ListNode?) -> ListNode? {
        guard let hd = head else {
            return nil
        }
        var newHd = hd
        while let next = hd.next {
            let tmp = next.next
            next.next = newHd
            hd.next = tmp
            newHd = next
            
        }
        return newHd
        
    }