题目描述
思路分析
栈模拟
最后结果是
m
i
n
_
s
t
k
min\_stk
min_stk是个单调栈。
代码实现
class MinStack {
public:
stack<int> stk;
stack<int> min_stk;
MinStack() {
}
void push(int val) {
stk.push(val);
if(min_stk.empty()||min_stk.top()>=val) min_stk.push(val);
}
void pop() {
int t=stk.top();stk.pop();
if(min_stk.top()==t) min_stk.pop();
}
int top() {
return stk.top();
}
int getMin() {
return min_stk.top();
}
};
/**
* Your MinStack object will be instantiated and called as such:
* MinStack* obj = new MinStack();
* obj->push(val);
* obj->pop();
* int param_3 = obj->top();
* int param_4 = obj->getMin();
*/