包含min函数的栈

求解代码

Stack<Integer>stackData1=newStack<Integer>();Stack<Integer>stackData2=newStack<Integer>();publicvoidpush(intnode){stackData1.push(node);if(stackData2.isEmpty()||node<=min()){stackData2.push(node);}}publicvoidpop(){if(stackData1.peek().equals(min())){stackData2.pop();}stackData1.pop();}publicinttop(){returnstackData1.peek();}publicintmin(){returnstackData2.peek();}

小贴士

用stackData1.peek().equals(min())来比较包装类的实际数值，也可以用stackData1.peek().intValue() == min()，效果是一样的。