30. 包含min函数的栈

定义栈的数据结构，请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中，调用 min、push 及 pop 的时间复杂度都是 O(1)。

示例:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.min();   --> 返回 -3.
minStack.pop();
minStack.top();   --> 返回 0.
minStack.min();   --> 返回 -2. 

提示：
各函数的调用总次数不超过 20000 次
 

代码实现1：辅助栈

class MinStack {

    Stack<Integer> stack;
    Stack<Integer> minstack;

    public MinStack() {
        stack = new Stack<>();
        minstack = new Stack<>();
    }

    public void push(int x) {
        stack.push(x);
        if (minstack.isEmpty() || minstack.peek() >= x) {
            minstack.push(x);
        }
    }

    public void pop() {
        if (minstack.peek().equals(stack.pop())) {
            minstack.pop();
        }
    }

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

    public int min() {
        return minstack.peek();
    }
}

 

代码实现2：无辅助栈

class MinStack {

    Deque<Long> stack;
    long min;

    public MinStack() {
        stack = new LinkedList<>();
    }

    public void push(int x) {
        if (stack.isEmpty()) {
            stack.push(0L);
            min = x;
        } else {
            stack.push(x - min);
            min = Math.min(min, x);
        }
    }

    public void pop() {
        if (stack.peek() < 0) min = min - stack.peek();
        stack.pop();
    }

    public int top() {
        if (stack.peek() < 0) return (int) min;
        else return (int) (stack.peek() + min);
    }

    public int min() {
        return (int) min;
    }
}