题解 | #判断一个链表是否为回文结构# 双指针求解

class Solution:
    def isPail(self , head: ListNode) -> bool:
        # write code here
        lst = []
        while head:
            lst.append(head.val)
            head = head.next
        n = len(lst)
        if n == 1 or n == 0:
            return True

        l, r = 0, n - 1
        while l < r:
            if lst[l] != lst[r]:
                return False
            l += 1
            r -= 1
        return True