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.
题意:设计一个栈,支持入栈,出栈,取栈顶元素,取栈中最小值元素等操作。
思路:对于入栈,出栈,取栈顶元素直接利用栈的性质即可实现。对于取栈中最小值元素,我们需要借助另一个栈s2来实现。该栈记录每个位置处当前栈中的最小值。当一个元素入栈时,将其与s2栈顶元素比较,若小于栈顶元素,则将该元素入栈s2,否则将栈顶元素入栈。
class MinStack {
public:
stack<int>s1,s2;
MinStack() {
}
void push(int x) {
s1.push(x);
if(s2.empty()||s2.top()>=x)
s2.push(x);
else
s2.push(s2.top());
}
void pop() {
s2.pop();
s1.pop();
}
int top() {
return s1.top();
}
int getMin() {
return s2.top();
}
};