leetcode(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.**

【分析】
题意为设计一个栈，且是”最小”栈，其中的getMin方法返回栈中的最小值。
思路是声明一个主栈和一个辅助栈，这个栈的栈顶保存的是入主栈的元素的最小值，这样getMin方法返回的始终是当前所有元素的最小值，时间复杂度为O(1).

Java实现：

public class MinStack {

    Stack<Integer> s,minS;

    /** initialize your data structure here. */
    public MinStack() {
       s= new Stack<>();
       minS = new Stack<>();
    }

    public void push(int x) {
        s.push(x);
        if(!minS.isEmpty() && minS.peek()<x) return ;
        minS.push(x);
    }

    public void pop() {
        int m = s.pop();
        if(m==minS.peek()) minS.pop();
    }

    public int top() {
        return s.peek();

    }

    public int getMin() {
        return minS.peek();

    }

}