leetcode 155原题如下:
设计一个支持 push,pop,top 操作,并能在常数时间内检索到最小元素的栈。
push(x) -- 将元素 x 推入栈中。
pop() -- 删除栈顶的元素。
top() -- 获取栈顶元素。
getMin() -- 检索栈中的最小元素。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
方法1:基本方法,原始栈+辅助栈,直接上代码,没做异常处理。
class MinStack {
private:
std::stack<int> stack,min;
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
stack.push(x);
if(min.empty() || min.top()>x)
{
min.push(x);
}
else
{
min.push(min.top());
}
}
void pop() {
stack.pop();
min.pop();
}
int top() {
return stack.top();
}
int getMin() {
return min.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();
*/
时间复杂度O(1),空间复杂度O(n);
如果难度再提升点,给个限制条件,数据范围[-100000,100000],能否空间复杂度降为O(1)?
也就是下面的方法。栈中保留 插入值与最小值的差值。
方法2:原始栈+ min
class MinStack {
private:
std::stack<int> stack;
int min;
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
if (stack.empty()) {
min = x;
stack.push(0);
} else {
int diff = x - min;
stack.push(diff);
min = diff < 0 ? x : min;
}
}
void pop() {
int top = stack.top();
min = top < 0 ? (min - top) : min;
stack.pop();
}
int top() {
if(stack.top()<0)
{
return min;
}
return stack.top()+min;
}
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();
*/