题解 | #包含min函数的栈#

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

public class Solution {
  //数组模拟栈

    ArrayList<Integer> list = new ArrayList<>();
    int idx = -1;
    
    public void push(int node) {
        idx ++;
        list.add(node);
    }
    
    public void pop() {
        list.remove(idx--);
    }
    
    public int top() {
        return list.get(idx);
    }
    
    public int min() {
        return list.stream().min((o1,o2) -> {
            return o1-o2;
        }).get();
    }
}