定义栈的数据结构,请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中,调用 min、push 及 pop 的时间复杂度都是 O(1)。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.min(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.min(); --> 返回 -2.
提示:
- 各函数的调用总次数不超过 20000 次
from typing import *
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.items = []
def push(self, x: int) -> None:
self.items.append(x)
def pop(self) -> None:
return self.items.pop()
def top(self) -> int:
return self.items[len(self.items) - 1]
def min(self) -> int:
return min(self.items)
def main():
minStack = MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
print(minStack.min());
print(minStack.pop());
print(minStack.top());
print(minStack.min());
if __name__ == '__main__':
main()