1 155. 最小栈
用了一下单调队列,AC代码:
class MinStack {
public:
vector<int> stack;
deque<int> q; // 来个单调减小队列
MinStack() {
stack.clear();
}
void push(int val) {
stack.push_back(val);
if(q.empty() || val <= q.back())q.push_back(val);
}
void pop() {
int tmp = stack[stack.size() - 1];
stack.pop_back();
if(tmp <= q.back())q.pop_back();
}
int top() {
return stack[stack.size() - 1];
}
int getMin() {
return q.back();
}
};
/**
* 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();
*/