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.
思路 :主要是在pop的时候可能pop出最小的值,所以用一个栈保存递减序列,栈顶为最小值。当pop的值大于min的时候,无需将min栈出栈。
class MinStack {
public:
stack<int> stk;
stack<int> min;
void push(int x) {
stk.push(x);
if(min.empty() || x <= min.top())
min.push(x);
}
void pop() {
if(stk.top() == min.top())
{
stk.pop();
min.pop();
}
else
stk.pop();
}
int top() {
return stk.top();
}
int getMin() {
return min.top();
}
};