实现一个特殊的栈,在实现栈的基本功能的基础上,再实现返回栈中最小元素的操作
思路:①创建两个栈——stackData用于存放数据,stackMin用于存放任一时刻 栈中的最小值
②根据下图来分析:首先压入4,Min中也压入4;然后压入5,5>4,所以Min中继续压入4;压入3,3<4,Min中压入3;压入6,Min中继续压入3。
③弹栈操作时,Min跟着Data栈一起弹出,这样可以保证任一时刻,Min栈的栈顶都是Data栈对应的最小元素。
import java.util.Stack;
public class e03SpecialStack {
private Stack<Integer> s1;
private Stack<Integer> s2;
public e03SpecialStack(){
s1=new Stack<Integer>();
s2=new Stack<Integer>();
}
public void push(int obj){
s1.push(obj);
if (s2.isEmpty()){
s2.push(obj);
}else{
s2.push(obj<s2.peek()?obj:s2.peek());
}
}
public Integer pop(){
if(s1.isEmpty()){
throw new RuntimeException("Your stack is empty.");
}
s2.pop();
return s1.pop();
}
public Integer min(){
if(s2.isEmpty()){
throw new RuntimeException("Your stack is empty.");
}
return s2.peek();
}
public static void main(String[] args) {
e03SpecialStack e03SpecialStack=new e03SpecialStack();
e03SpecialStack.push(9);
e03SpecialStack.push(6);
e03SpecialStack.push(7);
e03SpecialStack.push(8);
e03SpecialStack.push(4);
e03SpecialStack.push(5);
e03SpecialStack.pop();
e03SpecialStack.pop();
System.out.println(e03SpecialStack.min());
}
}