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

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

public class Solution {
    int stack[] = new int[300];
    int min[] = new int[300];
    int top = -1, minCur = Integer.MAX_VALUE;

    public void push(int node) {
        stack[++top] = node;
        if (node < minCur) 
            minCur = node;
        min[top] = minCur;
    }
    public void pop() {
        top--;
        if(min[top] > minCur)
            minCur = min[top];
    }

    public int top() {
        return stack[top];
    }

    public int min() {
        return minCur;
    }
}