LeetCode栈之最小栈155

栈

public class StackMin {
    Deque<Integer> Stack;
    Deque<Integer> minStack;
    /** initialize your data structure here. */
    public StackMin() {
        Stack=new LinkedList<>();
        minStack=new LinkedList<>();
        minStack.push(Integer.MAX_VALUE);
    }

    public void push(int x) {
        Stack.push(x);
        minStack.push(Math.min(x,minStack.peek()));
    }

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

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

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

学以致用

• 获取栈堆中最小的元素
  -1、新建一个栈Deque<Integer> minStack=new LinkedList<>();
  -2、堆顶放入一个无限大的数minStack.push(Integer.MAX_VALUE);
  -3、每一次与栈顶元素比较,并且将较小的元素放入堆顶minStack.push(Math.min(x,minStack.peek()));
  -4、minStack.peek()就可以获取到最小元素