Python-顺序栈部分功能的实现和一个小练习

class SqStack:
    def __init__(self, maxSize):
        self.maxSize = maxSize
        self.stackElem = [None] * self.maxSize
        self.top = 0

    def isEmpty(self):
        return self.top == 0

    def push(self, x):
        if self.top == self.maxSize:
            raise Exception("已满")
        self.stackElem[self.top] = x
        self.top += 1

    def pop(self):
        if self.isEmpty():
            return None
        self.top -= 1
        self.stackElem[self.top]=None


x = SqStack(5)
print(x.stackElem)
x.push(4)
print(x.stackElem)
x.push(3)
print(x.stackElem)
x.pop()
print(x.stackElem)

[None, None, None, None, None]
[4, None, None, None, None]
[4, 3, None, None, None]
[4, None, None, None, None]

判断一个字符串是否对称。
思路，出栈序列=原字符串