【剑指 offer】(Java) 包含min函数的栈

定义栈的数据结构，请在该类型中实现一个能够得到栈中所含最小元素的min函数（时间复杂度应为O（1））。

import java.util.Stack;

public class Solution {
    Stack<Integer> stack = new Stack<>();
    Stack<Integer> minstack = new Stack<>();
    
    
    public void push(int node) {
        if (stack.isEmpty()) {
            stack.push(node);
            minstack.push(node);
            return;
        }
        
        stack.push(node);
        
        int topVal = minstack.peek();
        if (node > topVal) {
            minstack.push(topVal);
        } else {
            minstack.push(node);
        }
    }
    
    public void pop() {
        stack.pop();
        minstack.pop();
    }
    
    public int top() {
        return stack.peek();
    }
    
    public int min() {
        return minstack.peek();
    }
}