设计一个支持 push
,pop
,top
操作,并能在常数时间内检索到最小元素的栈。
实现 MinStack
类:
MinStack()
初始化堆栈对象。void push(int val)
将元素val推入堆栈。void pop()
删除堆栈顶部的元素。int top()
获取堆栈顶部的元素。int getMin()
获取堆栈中的最小元素。
示例 1:
输入: ["MinStack","push","push","push","getMin","pop","top","getMin"] [[],[-2],[0],[-3],[],[],[],[]] 输出: [null,null,null,null,-3,null,0,-2] 解释: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> 返回 -3. minStack.pop(); minStack.top(); --> 返回 0. minStack.getMin(); --> 返回 -2.
提示:
-2^31 <= val <= 2^31 - 1
pop
、top
和getMin
操作总是在 非空栈 上调用push
,pop
,top
, andgetMin
最多被调用3 * 10^4
次
解法一:无脑用辅助栈
class MinStack {
stack<int> zhan;
stack<int> minzhan;
public:
MinStack() {
minzhan.push(INT_MAX);
}
void push(int val) {
zhan.push(val);
minzhan.push(min(minzhan.top(),val));
}
void pop() {
zhan.pop();
minzhan.pop();
}
int top() {
return zhan.top();
}
int getMin() {
return minzhan.top();
}
};
/**
* 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();
*/
解法二:用vector实现
class MinStack {
vector<int> data;
vector<int> min_values;
public:
MinStack() {
}
void push(int val) {
data.push_back(val);
if(min_values.empty()||val<=min_values.back())
min_values.push_back(val);
}
void pop() {
if(data.empty())
return ;
if(data.back()==min_values.back())
min_values.pop_back();
data.pop_back();
}
int top() {
if(data.empty()) return 0;
return data.back();
}
int getMin() {
if (min_values.empty()) return 0;
return min_values.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();
*/