最小栈（辅助栈）

设计一个支持 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.

python3:

class MinStack:
    s = []
    m = []#辅助栈

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.s = []
        self.m = []
        

    def push(self, x: int) -> None:
        self.s.append(x)
        if not self.m or x <= self.m[-1]:
            self.m.append(x)

    def pop(self) -> None:
        if self.s[-1] == self.m[-1]:
            self.m.pop()
        return self.s.pop()

    def top(self) -> int:
        return self.s[-1]

    def getMin(self) -> int:
        return self.m[-1]


# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()

c++:

class MinStack {
public:
    //两个栈的方法，一个辅助栈，一个实用栈
    stack<int>s;//主栈
    stack<int>p;//辅助栈
    /** initialize your data structure here. */
    MinStack() {
        
    }
    
    void push(int x) {
       s.push(x);
        if(p.empty()||x<=p.top()){
            p.push(x);
        }
    }
    
    void pop() {
        if(s.top()==p.top()){
            p.pop();
        }
        s.pop();        
    }
    
    int top() {
       return s.top(); 
    }
    
    int getMin() {
      return p.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();
 */