面试题 02.06. 回文链表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def isPalindrome(self, head: ListNode) -> bool:
        cur = head
        result = []
        while(cur):
            result.append(cur.val)
            cur = cur.next
        if result == result[::-1]:
            return True
        else:
            return False