题目:
面试题 03.02. 栈的最小值。
请设计一个栈,除了常规栈支持的pop与push函数以外,还支持min函数,该函数返回栈元素中的最小值。执行push、pop和min操作的时间复杂度必须为O(1)。
链接:https://leetcode.cn/problems/min-stack-lcci
示例:
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:
def __init__(self):
"""
initialize your data structure here.
"""
self.stack = []
self.minStack = []
def push(self, x: int) -> None:
if not self.minStack or x < self.minStack[-1]:
self.minStack.append(x)
elif x >= self.minStack[-1]:
self.minStack.append(self.minStack[-1])
self.stack.append(x)
def pop(self) -> None:
self.minStack.pop()
return self.stack.pop() if self.stack else []
def top(self) -> int:
return self.stack[-1] if self.stack else []
def getMin(self) -> int:
return self.minStack[-1] if self.minStack else []
# 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()