请设计一个栈,除了常规栈支持的pop与push函数以外,还支持min函数,该函数返回栈元素中的最小值。执行push、pop和min操作的时间复杂度必须为O(1)。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
通过次数28,849提交次数46,928
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/min-stack-lcci
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法一:构建辅助栈(双栈)
构建一个辅助栈用来存放栈不同阶段中的最小值,与push和pop操作同步更新即可,辅助栈初始化一个无穷大,在入栈的时候与辅助栈中已存在的数字相比较,值更小就压入辅助栈中,最后返回辅助栈顶元素,即为最小值。
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.stack=[]
self.min_stack=[math.inf]
def push(self, x: int) -> None:
self.stack.append(x)
self.min_stack.append(min(x,self.min_stack[-1]))
def pop(self) -> None:
self.stack.pop()
self.min_stack.pop()
def top(self) -> int:
return self.stack[-1]
def getMin(self) -> int:
return self.min_stack[-1]
# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()
方法二:单栈
使用一个栈也可以解决此题,初始化最小值min_value=math.inf为最大,当入栈值x小于min_value时,先将min_value入栈,再将x入栈。出栈时候,遇到出栈值==min_value时,需要做两次出栈操作,并更新min_value值,这样能够保证min_value为当前栈中最小值。
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.stack=[]
self.min_value=math.inf
def push(self, x: int) -> None:
if x<=self.min_value:
self.stack.append(self.min_value)
self.min_value=x
self.stack.append(x)
def pop(self) -> None:
if self.stack:
tem=self.stack.pop()
if tem==self.min_value:
self.min_value=self.stack.pop()
def top(self) -> int:
return self.stack[-1]
def getMin(self) -> int:
return self.min_value
# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()