leetcode最小栈问题

最小栈：

解析见代码：

import java.util.ArrayList;

/**
 * Create with Darcula IDEA
 * Description:
 * 最小栈
 */
public class MinStack {
    private ArrayList<Integer> normal;//辅助栈
    private ArrayList<Integer> min;//最小栈
/** initialize your data structure here. */
    public MinStack() {
        normal = new ArrayList<>();
        min = new ArrayList<>();
    }

    public void push(int x) {
        //先放入辅助栈
        normal.add(x);
        //这时看最小栈的情是否放入
        //最小栈为空，则入栈
        //最小栈不为空，则比较x与最小栈栈顶元素
        if(min.isEmpty()){
            min.add(x);
        }else if(x < min.get(min.size() - 1)){
            min.add(x);
        }else{
            min.add(min.get(min.size() - 1));
        }
    }

    public void pop() {
        min.remove(min.get(min.size() - 1));
        normal.remove(normal.size() - 1);
    }

    public int top() {
        return normal.get(normal.size() - 1);
    }

    public int getMin() {
        return min.get(min.size() - 1);
    }
}

/**
 * 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.getMin();
 */