1 题目
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
- push(x) -- Push element x onto stack.
- pop() -- Removes the element on top of the stack.
- top() -- Get the top element.
- getMin() -- Retrieve the minimum element in the stack.
Example:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> Returns -3.
minStack.pop();
minStack.top(); --> Returns 0.
minStack.getMin(); --> Returns -2.
2 标准解
2.1 分析
主要是getMin()方法,返回栈中最小值,在添加和删除时都需要维护。考虑第一个值被压入栈后,其之上所有比他大的数入栈出栈时都不需要维护,只有比它更小的值入栈出栈时,需要进行维护。即从栈底到栈顶,从栈底元素开始,依次提取每一个比上一个元素更小的值组成一个新的栈,用来维护最小值。
2.2 代码
class MinStack {
public:
stack<int> s1,s2;
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
s1.push(x);
if(s2.empty()||x <= getMin()) s2.push(x);
}
void pop() {
if(s1.top() == getMin()) s2.pop();
s1.pop();
}
int top() {
return s1.top();
}
int getMin() {
return s2.top();
}
};