234.palindrome-linked-list.py

from collections import deque

#
# @lc app=leetcode id=234 lang=python3
#
# [234] Palindrome Linked List
#

# @lc code=start
# 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:
        if not head or not head.next:
            return True

        container = []
        while head:
            container.append(head.val)
            head = head.next

        return container == container[::-1]


# @lc code=end