遍历链表,存入数组操作
class Solution:
def isPalindrome(self, head: ListNode) -> bool:
val = []
node = head
while node != None:
val.append(node.val)
node = node.next
return val == val[::-1]
遍历链表,存入数组操作
class Solution:
def isPalindrome(self, head: ListNode) -> bool:
val = []
node = head
while node != None:
val.append(node.val)
node = node.next
return val == val[::-1]