LeetCode刷题之路：234. 回文链表

请判断一个链表是否为回文链表。

示例 1:

输入: 1->2
输出: false
示例 2:

输入: 1->2->2->1
输出: true
进阶：
你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题？

#最直观的思路

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def isPalindrome(self, head: ListNode) -> bool:
        # val = []
        # cur = head
        # while cur:
        #     val.append(cur.val)
        #     cur = cur.next
        # left, right = 0, len(val)-1
        # while left< right:
        #     if val[left] != val[right]:
        #         return False
        #     left += 1
        #     right -= 1
        # return True

        if not head or not head.next:
            return True
        slow, fast = head, head
        pre, prepre =  None, None
        while fast != None and fast.next != None:
            pre = slow
            slow = slow.next
            fast = fast.next.next
            pre.next = prepre
            prepre = pre
            
        if fast != None:
            slow = slow.next
        
        while pre != None and slow != None:
            if pre.val != slow.val:
                return False
            pre = pre.next
            slow = slow.next
        return True