题目
设计一个支持 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.
解法一:
class MinStack {
public:
/** initialize your data structure here. */
MinStack() {
min_tmp = INT_MAX;
}
void push(int x) {
if(x <= min_tmp)
{
st.push(min_tmp);
min_tmp = x;
}
st.push(x);
}
void pop() {
int t = st.top();
st.pop();
if(t == min_tmp)
{
min_tmp = st.top();
st.pop();
}
}
int top() {
return st.top();
}
int getMin() {
return min_tmp;
}
private:
int min_tmp;
stack<int> st;
};
解法二
class MinStack {
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
stack_.emplace_back(x);
if(stack_.size() == 1)
curr_min_ = x;
else
{
curr_min_ = curr_min_ < x ? curr_min_ : x;
}
}
void pop() {
int back_val = top();
stack_.erase(stack_.end() - 1);
if(curr_min_ == back_val)
{
curr_min_ = stack_.front();
for(auto & ele : stack_)
{
if (curr_min_ > ele)
curr_min_ = ele;
}
}
}
int top() {
return stack_.back();
}
int getMin() {
return curr_min_;
}
private:
vector<int> stack_;
int curr_min_;
};