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

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

public class Solution {
    private Stack stack = new Stack();

    public void push(int node) {
        stack.push(node);
    }

    public void pop() {
        stack.pop();
    }

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

    public int min() {
        int min = 0;
        if(stack.isEmpty())
            return min;
        Stack stack_tmp = new Stack();
        min = (int)stack.peek();
        while (!stack.isEmpty()) {
            int value = 0;
            value = (int)stack.pop();
            if (value < min) {
                min = value;
            }
            stack_tmp.push(value);
        }
        while(!stack_tmp.isEmpty()){
            stack.push(stack_tmp.pop());
        }
        return min;
    }
}