题目
https://leetcode-cn.com/problems/min-stack/
思路
辅助栈,每次压入当前数据栈内所有元素的最小值
AC代码
class MinStack {
public:
/** initialize your data structure here. */
stack<int>s;
stack<int>mins; //辅助栈,每次存进去当前栈内所有元素的最小值
MinStack() {
}
void push(int x) {
s.push(x);
if(mins.empty()){ //需要判断,不然不给过。。。
mins.push(x);
}
else{
if(mins.top() > x)
mins.push(x);
else mins.push(mins.top());
}
}
void pop() {
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();
*/