LeetCode-155. 最小栈

 

目录

155. 最小栈

---

155. 最小栈

【题目】：

【代码】：定义两个栈，dataStack存储当前入栈的数据，minStack同步存储当前入栈的元素中的最小元素。

class MinStack {
    private Stack<Integer> dataStack;
    private Stack<Integer> minStack;
    private int min;

    /** initialize your data structure here. */
    public MinStack() {
        dataStack=new Stack<>();
        minStack=new Stack<>();
        min=Integer.MAX_VALUE;
    }
    
    public void push(int x) {
        dataStack.push(x);
        min=Math.min(min, x);
        minStack.push(min);
    }
    
    public void pop() {
        dataStack.pop();
        minStack.pop();
        min = minStack.empty() ? Integer.MAX_VALUE : minStack.peek();
    }
    
    public int top() {
        return dataStack.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();
 */

效果：