package algorithm;

import java.util.Deque;

import java.util.LinkedList;

/**

* https://leetcode-cn.com/problems/min-stack/solution/fu-zhu-zhan-zui-xiao-zhan-by-demigodliu-wnpk/

*/

public class MinStack {

Deque<Integer> xStack;

Deque<Integer> minStack;

public MinStack() {

xStack = new LinkedList<Integer>();

minStack = new LinkedList<Integer>();

minStack.push(Integer.MAX_VALUE);

}

public void push(int x) {

xStack.push(x);

minStack.push(Math.min(minStack.peek(), x));

}

public void pop() {

xStack.pop();

minStack.pop();

}

public int top() {

return xStack.peek();

}

public int getMin() {

return minStack.peek();

}

}