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.

分析

其他三种方法都可以用简单的栈来实现
getmin 就比较复杂了

需要在压入元素的同时，记录最小元素。因此再记录一个栈，记录压入当前元素时的栈内最小。

 class MinStack {
        Stack<Integer> stack;
        Stack<Integer> minStack;

        /** initialize your data structure here. */
        public MinStack() {
            stack = new Stack<>();
            minStack  = new Stack<>();
        }

        public void push(int x) {
            stack.push(x);
            if (minStack.isEmpty()) {
                minStack.push(x);               
            } else {
                int min= minStack.peek();
                min = Math.min(min, x);
                minStack.push(min);

            }

        }


        public void pop() {
            stack.pop();
            minStack.pop();
        }

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

        public int getMin() {
            return minStack.peek();
        }
    }