面试题30. 包含min函数的栈
定义栈的数据结构,请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中,调用 min、push 及 pop 的时间复杂度都是 O(1)。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.min(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.min(); --> 返回 -2.
提示:
各函数的调用总次数不超过 20000 次
这道题双栈维护也可以做,单栈做法很巧妙。每次栈中压入更小数值,和如果去掉更小数后的最小值。如果出栈是更小数,就弹出两个,并改变最小值
class MinStack {
public:
/** initialize your data structure here. */
stack<int>_stack;
int _min=INT_MAX;
MinStack() {
}
void push(int x) {
if(_min>=x){
if(!_stack.empty()){
_stack.push(_min);
}
_min=x;
}
_stack.push(x);
}
void pop() {
if(_stack.empty())
return ;
if(_stack.size()==1)
_min=INT_MAX;
else if(_min==_stack.top()){
_stack.pop();
_min=_stack.top();
}
_stack.pop();
}
int top() {
return _stack.top();
}
int getMin() {
return _min;
}
};
/**
* 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();
*/
双栈做法也比较清晰,用辅助栈来对应每次的最小值,同时push同时pop就可以了
class MinStack {
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
main_stk.push(x);
if(help_stk.empty()) help_stk.push(x);
else {
if(x < help_stk.top()){
help_stk.push(x);
}else{
int temp = help_stk.top();
help_stk.push(temp);
}
}
}
void pop() {
main_stk.pop();
help_stk.pop();
}
int top() {
return main_stk.top();
}
int getMin() {
return help_stk.top();
}
private:
stack<int> main_stk;
stack<int> help_stk;
};
/**
* 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();
*/