题目:
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
- push(x) -- Push element x onto stack.
- pop() -- Removes the element on top of the stack.
- top() -- Get the top element.
- getMin() -- Retrieve the minimum element in the stack.
题目来源:https://oj.leetcode.com/problems/min-stack/
解题思路:在这个栈中维护一个栈,每当有<=栈的最小值的值入栈就把这个最小值同时弹入另一个栈中,这个维护的栈顶就是当前栈中的最小的元素。注意:在遇到与当前最小值相等的元素时,也要入栈,这样在弹出时,就不会引起错误了!!
#include<iostream>
#include<stack>
using namespace std;
class MinStack {
stack<int> S;
stack<int> minS;
public:
void push(int x) {
S.push(x);
if(minS.empty() || x<=minS.top())
minS.push(x);
}
void pop() {
if(S.top()==minS.top())
minS.pop();
S.pop();
}
int top() {
return S.top();
}
int getMin() {
return minS.top();
}
};
int main()
{
MinStack s;
s.push(-3);
s.push(-2);
cout<<s.getMin()<<endl;
system("pause");
return 0;
}