class Stack(object): def __init__(self): self.stack = [] def push(self, item): self.stack.append(item) def pop(self): return self.stack.pop() def peek(self): if len(self.stack)>=1: return self.stack[-1] else: return '栈空' # 测试用例 if __name__ == '__main__': st = Stack() st.push(1) st.push(2) print(st.pop()) print(st.peek()) print(st.pop())
用数组实现一个顺序栈
最新推荐文章于 2024-04-25 21:57:47 发布