难度简单1053收藏分享切换为英文接收动态反馈
设计一个支持 push
,pop
,top
操作,并能在常数时间内检索到最小元素的栈。
push(x)
—— 将元素 x 推入栈中。pop()
—— 删除栈顶的元素。top()
—— 获取栈顶元素。getMin()
—— 检索栈中的最小元素。
示例:
输入: ["MinStack","push","push","push","getMin","pop","top","getMin"] [[],[-2],[0],[-3],[],[],[],[]] 输出: [null,null,null,null,-3,null,0,-2] 解释: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> 返回 -3. minStack.pop(); minStack.top(); --> 返回 0. minStack.getMin(); --> 返回 -2.
提示:
pop
、top
和getMin
操作总是在 非空栈 上调用。
class MinStack(object):
def __init__(self):
self.stack = []
self.min_stack = []
def push(self, val):
"""
:type val: int
:rtype: None
"""
self.stack.append(val)
# 如果为空则不需判断,直接入栈
if not self.min_stack:
self.min_stack.append(val)
# 原栈顶与新数值比较,如果大于等于新数则新数值入栈,否则原栈顶数值入栈
elif self.min_stack[-1] >= val:
self.min_stack.append(val)
else:
self.min_stack.append(self.min_stack[-1])
def pop(self):
"""
:rtype: None
"""
self.stack.pop()
self.min_stack.pop()
def top(self):
"""
:rtype: int
"""
return self.stack[-1]
def getMin(self):
"""
:rtype: int
"""
return self.min_stack[-1]
# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(val)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()