题解 | 判断一个链表是否为回文结构

# 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
        list1=[]
        node=head
        while node:
            list1.append(node.val)
            print(node.val)
            node=node.next
        if list1==list1[::-1]:
            return True
        return False