# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# @param head, a ListNode
# @return a boolean
def isPalindrome(self, head):
if head == None:
return True
L = []
p1 = head
while p1 != None:
L.append(p1.val)
p1 = p1.next
if L == L[::-1]:
return True
return False
LintCode:回文链表
最新推荐文章于 2020-01-03 22:49:41 发布