Swift 回文链表 - LeetCode

输入: 1->2
输出: false

输入: 1->2->2->1
输出: true

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public var val: Int
 *     public var next: ListNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.next = nil
 *     }
 * }
 */
class Solution {
    func isPalindrome(_ head: ListNode?) -> Bool {
        if head == nil {
            return true
        }
        var temp = head
        var listArray = [Int]()
        while temp != nil {
            listArray.append(temp!.val)
            temp = temp?.next
        }
        let count = listArray.count
        for i in 0...(count / 2) {
            if (listArray[i] != listArray[count-1-i]) {
                return false
            }
        }
        return true
    }
}