155.Min Stack（Stack-Easy）

转载请注明作者和出处：http://blog.csdn.net/c406495762

    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.

Example:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); –> Returns -3.
minStack.pop();
minStack.top(); –> Returns 0.
minStack.getMin(); –> Returns -2.

题目： 设计一个支持push、pop、top和能返回最小值stack中最小值的stack

思路： 创建两个stack，一个保存所有元素，一个负责保存最小元素。保存最小元素的top元素即为所有元素的最小元素。看代码，很容易理解。

Language : cpp

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> all_stk;
    stack<int> min_stk;

    void push(int x) {
        all_stk.push(x);
        if(min_stk.empty() || min_stk.top() >= x){
            min_stk.push(x);
        }
    }
    void pop() {
        if(all_stk.top() == min_stk.top()){
            min_stk.pop();
        }
        all_stk.pop();
    }

    int top() {
        if(all_stk.empty()){
            return 0;
        }
        else{
            return all_stk.top();
        }
    }

    int getMin() {
        if(min_stk.empty()){
            return 0;
        }
        else{
            return min_stk.top();
        }
    }
};

/**
 * 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();
 */