/* Acception of mine!*/
/*
#include <vector>
using namespace std;
class MinStack {
public:
//initialize your data structure here.
MinStack() {
m_data.clear();
}
void push(int x) {
m_data.push_back(x);
}
void pop() {
if( !m_data.empty())
m_data.pop_back();
}
int top() {
if(m_data.empty()) return 0;
return m_data.back();
}
int getMin() {
if(m_data.empty()) return 0;
int myMin = m_data[0];
for(int j=0; j<m_data.size();j++)
{
if(m_data[j]<myMin) myMin = m_data[j];
}
return myMin;
}
private:
vector<int> m_data;
};
*/
/**
* 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();
*/
class MinStack {
private:
stack<int> s1;
stack<int> s2;
public:
void push(int x) {
s1.push(x);
if (s2.empty() || x <= getMin()) s2.push(x);
}
void pop() {
if (s1.top() == getMin()) s2.pop();
s1.pop();
}
int top() {
return s1.top();
}
int getMin() {
return s2.top();
}
};
155. Min Stack
猜你喜欢
转载自blog.csdn.net/bjzhaoxiao/article/details/80265246
今日推荐
周排行