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

import java.util.Stack;

public class Solution {

    Stack<Integer> minStack = new Stack<>();
    Stack<Integer> dataStack = new Stack<>();

    public void push(int node) {
        dataStack.push(node);
        minStack.push(minStack.isEmpty() ? node : Math.min(minStack.peek(), node));
    }

    public void pop() {
        dataStack.pop();
        minStack.pop();
    }

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

    public int min() {
        return minStack.peek();
    }
}