LeetCode-155 Min Stack Solution (with Java)

1. Description: 

2. Examples:

3.Solutions:

/**
 * Created by sheepcore on 2019-05-07
 * 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();
 */
class MinStack {
    /** initialize your data structure here. */
     private Stack<Integer> stack;

    public MinStack(){
        stack = new Stack<Integer>();
    }
    public int getMin(){
        int min = Integer.MAX_VALUE;
        for(Integer integer : stack){
            if(integer < min)
                min = integer;
        }
        return min;
    }
    public void push(int x){
        stack.push(x);
    }

    public int top(){
        return stack.peek();
    }

    public int pop(){
        return stack.pop();
    }
}