155-最小元素的栈

最小栈

public class MinStack {
    Stack <Integer> st;
    Stack <Integer> minStack;
    /** initialize your data structure here. */
    public MinStack() {
       st = new Stack<>(); 
       minStack = new Stack<>();
    }
    public void push(int x) {
        st.push(x);
        if(minStack.isEmpty()){
            minStack.push(x);
        }
        else{
            minStack.push(Math.min(x,minStack.peek()));
        }
    }
    public void pop() {
        st.pop();
        minStack.pop();
    }   
    public int top() {
        return st.peek();
    }
    public int getMin() {
        return minStack.peek();
    }
}