剑指 Offer 09. 用两个栈实现队列
题目描述
定义栈的数据结构,请在该类型中实现一个能够得到栈的最小元素的 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 次
来源:LeetCode
Python实现
class MinStack(object):
def __init__(self):
"""
initialize your data structure here.
"""
self.stackdata=[]
self.stackmin=[]
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.stackdata.append(x);
if (len(self.stackmin)==0 or x<self.stackmin[-1]):
self.stackmin.append(x)
else:
self.stackmin.append(self.stackmin[-1])
def pop(self):
"""
:rtype: None
"""
self.stackdata.pop()
self.stackmin.pop()
def top(self):
"""
:rtype: int
"""
head=self.stackdata[-1]
return head
def min(self):
"""
:rtype: int
"""
mindata=self.stackmin[-1]
return mindata
# 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()