双栈法
https://leetcode-cn.com/problems/min-stack/solution/zui-xiao-zhan-c-by-zed-65536/
class MinStack {
private:
stack<int> s1,s2;
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
s1.push(x);
if(s2.empty()) s2.push(x);
else{
int t=s2.top();
s2.push((x<t)?x:t);
}
}
void pop() {
s1.pop();
s2.pop();
}
int top() {
return s1.top();
}
int getMin() {
return s2.top();
}
};
实际栈数据存储pair<min, value>
https://leetcode-cn.com/problems/min-stack/solution/shi-ji-zhan-shu-ju-cun-chu-pairmin-value-by-khrisw/
class MinStack {
private:
int min=INT_MAX;
stack<pair<int,int>> minstack;
public:
/** initialize your data structure here. */
MinStack(){}
void push(int x) {
if(x<min) min=x;
minstack.push(make_pair(min,x));
}
void pop() {
minstack.pop();
if(minstack.empty()) min=INT_MAX;
else min=minstack.top().first;
}
int top() {
return minstack.top().second;
}
int getMin() {
return minstack.top().first;
}
};