不考虑溢出，代码在这里 import java.util.Stack; import java.lang.Math; public class Solution { Stack<integer> stack = new Stack<>(); int min = Integer.MAX_VALUE; public void push(int node) { if(stack.isEmpty()) { min = node; stack.push(0); } else { stack.push(node - min); min = Math.min(node, min); } } public void pop() { int val = stack.pop(); if(val < 0) { min -= val; } else { min = Math.min(min + val, min); } } public int top() { int val = stack.peek(); if(val < 0) { return min; } else { return min + val; } } public int min() { return min; } }</integer>