题目:定义栈的数据结构,请在该类型中实现一个能够得到栈最小元素的min函数。在该栈中,调用min、push、pop的时间复杂度都是O(1)
class Solution:
def __init__(self):
self.stack = [] # 数据栈
self.minStack = [] # 辅助栈
def push(self, node):
self.stack.append(node)
if self.minStack==[] or node<self.min():
self.minStack.append(node)
else:
temp = self.min()
self.minStack.append(temp)
def pop(self):
if self.stack or self.minStack==[]:
return None
self.stack.pop()
self.minStack.pop()
def top(self):
return self.stack[-1]
def min(self):
return self.minStack[-1]