1. 栈是后进先出的数据结构
2. 用数组实现栈的数据结构,是其具有如下功能:压栈、弹栈、取栈顶元素、判断栈是否为空以及获取栈
中的元素个数
classMyStack:def__init__(self):"""
Initialize your data structure here.
"""
self.item =[]defpush(self, x:int)->None:"""
Push element x onto stack.
"""
self.item.append(x)defpop(self)->int:"""
Removes the element on top of the stack and returns that element.
"""iflen(self.item)>0:return self.item.pop()else:returnNonedeftop(self)->int:"""
Get the top element.
"""iflen(self.item)>0:return self.item[len(self.item)-1]else:returnNonedefempty(self)->bool:"""
Returns whether the stack is empty.
"""returnlen(self.item)==0