剑指 Offer 30. 包含min函数的栈
- 定义栈的数据结构,请在该类型中实现一个能够得到栈的最小元素的 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 次
class MinStack(object):
def __init__(self):
"""
initialize your data structure here.
"""
self.datastack = []
self.minstack = []
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.datastack.append(x)
if not self.minstack or x < self.minstack[-1]:
self.minstack.append(x)
else:
self.minstack.append(self.minstack[-1])
def pop(self):
"""
:rtype: None
"""
if not self.datastack:
return None
if self.datastack:
self.minstack.pop()
return self.datastack.pop()
def top(self):
"""
:rtype: int
"""
return self.datastack[-1]
def min(self):
"""
:rtype: int
"""
return self.minstack[-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.min()