判断一个链表是否为回文结构的python实现:
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param head ListNode类 the head
# @return bool布尔型
#
class Solution:
def isPail(self , head: ListNode) -> bool:
# write code here
mylist = []
while head:
mylist.append(head.val)
head = head.next
ll = len(mylist)
for i in range(ll//2):
if mylist[i]!=mylist[ll-i-1]:
return False
return True