leetcode刷题之 栈和队列(3):最小值栈

[LeetCode] 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.

 

这道最小栈跟原来的栈相比就是多了一个功能，可以返回该栈的最小值。使用两个栈来实现，一个栈来按顺序存储push进来的数据，另一个用来存出现过的最小值。

 

class MinStack {
    private Stack<Integer> stack;
    private Stack<Integer> minstack;
    private int min;

    /** initialize your data structure here. */
    public MinStack() {
        this.stack = new Stack<Integer>();
        this.minstack = new Stack<Integer>();
        this.min = Integer.MAX_VALUE;
    }   
    
    public void push(int x) {
        stack.push(x);
        min = Math.min(min, x);//每加一个数就把当前比较后最小的数存下来，这样有多少个值就有多少个最小值
        minstack.add(min);
    }
    
    public void pop() {
        stack.pop();
        minstack.pop();
        //如果中间空开的话 比如先取完5个值 再加入3个值 此时你的min是前5个值中最小的
        //你需要把min重置为Integer.MAX_VALUE
        min = minstack.isEmpty() ? Integer.MAX_VALUE : minstack.peek();        
    }
    
    public int top() {
        return stack.peek();
    }
    
    public int getMin() {
        return minstack.peek();
    }
}

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