LeetCode 234. Palindrome Linked List

题目描述：
Given a singly linked list, determine if it is a palindrome.

Follow up:
Could you do it in O(n) time and O(1) space?

AC代码：

class Solution(object):    def isPalindrome(self, head):        """        判断是否为回文列表        :type head: ListNode        :rtype: bool        """        if not head or not head.next:            return True        list_node = []        while head:            list_node.append(head.val)            head = head.next        if list_node == list_node[::-1]:            return True        else:            return False