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

import java.util.*;
import java.util.Stack;

public class Solution {
    
    int[] stack = new int[300];
    int tail = -1;
    int[] mins = new int[300]; 

    public void push(int node) {
        stack[++tail] = node;
        if(tail!=0){
            mins[tail] = Math.min(mins[tail-1],node);
        }else{
            mins[tail] = node;
        }
        

    }
    
    public void pop() {
        tail--;
    }
    
    public int top() {
        return stack[tail];
    }
    
    public int min() {
        return mins[tail];
    }
}