155. 最小栈

题目：

https://leetcode-cn.com/problems/min-stack/

import java.util.ArrayList;
import java.util.Stack;

public class _155_MinStack {
    /**
     * initialize your data structure here.
     */
    public ArrayList<Integer> list;
    public Stack<Integer> stack;

    public _155_MinStack() {
        list = new ArrayList<>();
        stack = new Stack<>();
    }

    public void push(int val) {
        stack.push(val);
        for (int i = 0; i < list.size(); i++) {
            if (val > list.get(i)) {
                list.add(i, val);
                return;
            }
        }
        list.add(list.size(), val);
    }

    public void pop() {
        list.remove(list.indexOf(stack.peek()));
        stack.pop();
    }

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

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

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        _155_MinStack obj = new _155_MinStack();
        obj.push(-2);
        obj.push(0);
        obj.push(-1);
        int param_1 = obj.getMin();
        int param_3 = obj.top();
        obj.pop();
        int param_4 = obj.getMin();
    }
}