剑指offeer T30包含min函数的栈

思想:利用两个栈（LinkedList）来实现，栈stack用于存储所有元素，栈minStack用于存储stack中的最小元素

class MinStack {
    LinkedList<Integer> stack;
     LinkedList<Integer> minStack;
    /** initialize your data structure here. */
    public MinStack() {
     stack = new LinkedList<>();
     minStack = new LinkedList<>();
    }
    
    public void push(int x) {
     stack.push(x);
     if(minStack.isEmpty()||x<=minStack.peek()){
         minStack.push(x);
     }
    }
    
    public void pop() {
     //出栈时只有当stack与minStack要出栈的元素一样时才出栈minStack中的元素   
     if(stack.pop().equals(minStack.peek())){
         minStack.pop();
     }
    }
    
    public int top() {
    return stack.peek();
    }
    
    public int min() {
     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.min();
 */