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

#coding:utf-8
# 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 ):
        # write code here
        #Corner
        if head == None or head.next == None:
            return True
        #Common
        stack = []
        dummy = head
        while dummy != None:
            stack.append(dummy.val)
            dummy = dummy.next
        print ("Stack: ", stack)

        dummy = head
        while dummy != None:
            tail_val = stack.pop()
            if dummy.val != tail_val:
                return False
            dummy = dummy.next
        return True