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 -

class MinStack {

		    /** initialize your data structure here. */
		    private Stack<Integer> st;
            private int min;
            private boolean flag;
		    public MinStack() {
		        st=new Stack<Integer>();
                min=Integer.MAX_VALUE;
                flag=true;
                
		    }
		    
		    public void push(int x) {
		       st.push(x);
                if(x<min)min=x;
		    }
		    
		    public void pop() {
                if(st.peek()==min)
                {
                    flag=false;//最小值被删了 取的时候重新计算
                }
                 st.pop();
                
		    }
		    
		    public int top() {
		        return st.peek();
		    }
		    
		    public int getMin() {
		       if(flag)return min;
		        else
                {
                    min=Integer.MAX_VALUE;
                    for(int x:st)
                    {
                        if(x<min)min=x;
                    }
                    return min;
                }
		    }
		}

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

2.