地址:点击打开链接
遍历一遍链表存到数组里面,然后将数组进行头尾遍历,看是否相等
答案:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def isPalindrome(self, head):
"""
:type head: ListNode
:rtype: bool
"""
if head == None:
return True
valueList = []
p = head
while p:
valueList.append(p.val)
p = p.next
end = len(valueList) - 1
begin = 0
while begin <= len(valueList) - 1 or end >= 0:
if valueList[begin] != valueList[end]:
return False
begin += 1
end -= 1
return True