LEETCODE 234. 回文链表

# 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: Optional[ListNode]) -> bool:
        stack=[]
        cur=head
        while cur:
            stack.append(cur)
            cur=cur.next
        cur=head
        while stack:
            p=stack.pop()
            if cur.val !=p.val:
                return False
            cur=cur.next
        return True