设计一个支持 push ,pop ,top 操作,并能在常数时间内检索到最小元素的栈。
push(x) —— 将元素 x 推入栈中。
pop() —— 删除栈顶的元素。
top() —— 获取栈顶元素。
getMin() —— 检索栈中的最小元素。
pair用法
stack栈内同时保存
class MinStack {
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
if(st.size()==0)
st.push({x,x});
else
{
st.push({x,min(x,st.top().second)});
}
}
void pop() {
st.pop();
}
int top() {
return st.top().first;
}
int getMin() {
return st.top().second;
}
private:
stack<pair<int,int> > st;
};
/**
* 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 {
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
if(num.size()==0&&minnum.size()==0)
{
num.push(x);
minnum.push(x);
}
else
{
minnum.push(min(x,minnum.top()));
num.push(x);
}
}
void pop() {
num.pop();
minnum.pop();
}
int top() {
return num.top();
}
int getMin() {
return minnum.top();
}
private:
stack<int> num;
stack<int> minnum;
};
/**
* 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();
*/