题目描述:
设计一个支持push,pop,top等操作并且可以在O(1)时间内检索出最小元素的堆栈。
- push(x)–将元素x插入栈中
- pop()–移除栈顶元素
- top()–得到栈顶元素
- getMin()–得到栈中最小元素
样例
MinStack minStack = new MinStack();
minStack.push(-1);
minStack.push(3);
minStack.push(-4);
minStack.getMin(); --> Returns -4.
minStack.pop();
minStack.top(); --> Returns 3.
minStack.getMin(); --> Returns -1.
算法:
class MinStack {
private:
stack<int>s;
stack<int>mins;
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
s.push(x);
if(mins.empty())
{
mins.push(x);
}
else
{
if(x < mins.top())
{
mins.push(x);
}
else
mins.push(mins.top());
}
}
void pop() {
if(!s.empty())
{
s.pop();
mins.pop();
}
}
int top() {
return s.top();
}
int getMin() {
return mins.top();
}
};
/**
* Your MinStack object will be instantiated and called as such:
* MinStack obj = new MinStack();
* obj.push(x);
* obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.getMin();
*/