方法一:双栈模拟最小栈:时间O(1),空间O(n)
题解:
- 要保证push(),pop(),min()等函数的时间复杂度都是O(1),因此我们管理一个最小栈,专门用来存放当前栈中最小的值
- push():push栈直接插入,min栈:判断栈顶元素和插入元素的大小,如果插入元素较小或者相等则插入
- pop():push栈直接删除,min栈:判断栈顶元素是否和push栈删除的元素相同,相同则删除
class MinStack {
private:
stack<int> push_stc;
stack<int> min_stc;
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
push_stc.push(x);
if (min_stc.empty() || min_stc.top() >= x)
{
min_stc.push(x);
}
}
void pop() {
if (push_stc.empty())
return;
if (push_stc.top() == min_stc.top())
min_stc.pop();
push_stc.pop();
}
int top() {
if (push_stc.empty())
return -1;
return push_stc.top();
}
int min() {
if (min_stc.empty())
return -1;
return min_stc.top();
}
};