BM43 包含min函数的栈

算法思想：一个栈来记录最小值栈，也就是每一个正常入栈的值对应的最小值也入栈

import java.util.Stack;

public class Solution {

    Stack<Integer> stack = new Stack<>();
    Stack<Integer> minStack = new Stack<>();
    
    public void push(int node) {
        stack.push(node);
        if(minStack.isEmpty()){
           minStack.push(node); 
        }else{
            minStack.push(Math.min(node,minStack.peek()));
        }
    }
    
    public void pop() {
//        if(minStack.peek()==stack.peek()){
//            minStack.pop();
//        } 
        minStack.pop();
        stack.pop();
    }
    
    public int top() {
        return stack.peek();
    }
    
    public int min() {
        return minStack.peek();
    }
}