设计一个支持 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.
链接:https://leetcode-cn.com/problems/min-stack
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.A = []
def push(self, val: int) -> None:
if not self.A:
self.A.append((val, val))
else:
self.A.append((val, min(val, self.A[-1][1])))
def pop(self) -> None:
self.A.pop()
def top(self) -> int:
return self.A[-1][0]
def getMin(self) -> int:
return self.A[-1][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()
Leetcode 155. 最小栈 (每日一题 20210923)
最新推荐文章于 2022-03-12 22:41:16 发布