Leetcode - 234. Palindrome Linked List

일시불 -

문제

Loading...
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
LeetCode

정답

# 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:
        stack = []
        while head is not None:
            stack.append(head.val)
            head = head.next
            
        return stack == stack[::-1]: