包含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 次
解题思路:
java
class MinStack {
Stack<Integer> A, B;
public MinStack() {
A = new Stack<>();
B = new Stack<>();
}
public void push(int x) {
A.add(x);
if(B.empty() || B.peek() >= x)
B.add(x);
}
public void pop() {
if(A.pop().equals(B.peek()))
B.pop();
}
public int top() {
return A.peek();
}
public int min() {
return B.peek();
}
}
python
class MinStack(object):
def __init__(self):
"""
initialize your data structure here.
"""
self.resA, self.resB = [], []
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.resA.append(x)
if not self.resB or self.resB[-1]>=x:
self.resB.append(x)
def pop(self):
"""
:rtype: None
"""
if self.resA.pop()==self.resB[-1]:
self.resB.pop()
def top(self):
"""
:rtype: int
"""
return self.resA[-1]
def min(self):
"""
:rtype: int
"""
return self.resB[-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()