题目:
设计一个支持 push,pop,top 操作,并能在常数时间内检索到最小元素的栈。
- push(x) -- 将元素 x 推入栈中。
- pop() -- 删除栈顶的元素。
- top() -- 获取栈顶元素。
- getMin() -- 检索栈中的最小元素。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
代码一:
用一个变量保存当前栈的最小值(入栈出栈需要更新)。
class MinStack(object):
def __init__(self):
"""
初始化栈,最小值
initialize your data structure here.
"""
self.stack = []
self.min = None
def push(self, x):
"""
入栈
:type x: int
:rtype: void
"""
if self.min == None or self.min > x:
self.min = x
self.stack.append(x)
def pop(self):
"""
删除栈顶元素
:rtype: void
"""
stackTop = self.stack.pop()
if len(self.stack) == 0:
self.min = None
if stackTop == self.min:
self.min = self.stack[0]
for i in self.stack:
if i < self.min:
self.min = i
def top(self):
"""
获取栈顶元素
:rtype: int
"""
if self.stack ==None:
return 'error'
else:
return self.stack[-1]
def getMin(self):
"""
检索栈中最小元素
:rtype: int
"""
return self.min
# 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()
思路一:设置一个最小值变量,在进栈出栈的时候都计算出栈中最小的值。这样在最小值计算函数里面直接调用最小值变量的值即代码er
代码二:
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.stack = list()
self.tmp = list()
def push(self, x: int) -> None:
self.stack.append(x)
if len(self.tmp)==0:
self.tmp.append(x)
else:
if self.tmp[-1]>x:
self.tmp.append(x)
else:
self.tmp.append(self.tmp[-1])
def pop(self) -> None:
if self.stack != None:
self.stack.pop()
self.tmp.pop()
def top(self) -> int:
return self.stack[-1]
def getMin(self) -> int:
return self.tmp[-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()
思路二:
设置一个辅助栈,每次进栈时辅助栈中压入当前栈中最小的值。