<easy>LeetCode Problem -- 155. Min Stack

• 描述：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.

• 分析：要求实现一个类------MinStack，这个类具有如下四种操作：
  push(x) — push一个元素到栈中
  pop() — pop栈顶元素
  top() — 得到栈顶元素
  getMin() — 得到栈中最小值
• 思路一：用两个栈来实现这个类，其中一个栈用来存储所有元素，另一个栈用来存储当前每次push序列的最小值。

class MinStack {
public:
    /** initialize your data structure here. */
    MinStack() {}
    
    void push(int x) {
        my_stack.push(x);
        if (min_stack.empty()) min_stack.push(x);
        else if (!min_stack.empty() && min_stack.top() >= x)   min_stack.push(x);  // 如果新push的元素小于min_stack栈顶元素，则认为他是当前最小的元素，把它push进min_stack
    }
    
    void pop() {
        if (my_stack.top() == min_stack.top()) min_stack.pop();
        my_stack.pop();
    }
    
    int top() {
        return my_stack.top();
    }
    
    int getMin() {
        return min_stack.top();
    }
private:
    stack<int> my_stack;  // 存储全部元素
    stack<int> min_stack;  // 存储时刻序列的最小值
};

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