解法一
辅助栈存当下最小值
class MinStack {
public:
/** initialize your data structure here. */
stack<int> s_data;
stack<int> s_min;
MinStack() {
}
void push(int x) {
s_data.push(x);
if(s_min.size()==0) s_min.push(x);//if else逻辑关系要完整
else{
if(s_min.top()<x) s_min.push(s_min.top());
else s_min.push(x);
}
}
void pop() {
if(s_data.size()==0) return ;
s_data.pop();
s_min.pop();
}
int top() {
return s_data.top();
}
int min() {
return s_min.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->min();
*/