栈的特性先进后出,队列的特性先进先出
public Integer pop(){
if (inStack.empty() && outStack.empty())//非空判断
throw new RuntimeException("空队列");//抛出异常
if (outStack.empty()){//出栈为空
while (!inStack.empty())//入栈不为空
outStack.push(inStack.pop());//顺序倒置
}
return outStack.pop();
}
public static void main(String[] args) {
Myqueue myqueue=new Myqueue();
myqueue.push(1);
myqueue.push(2);
myqueue.push(3);
myqueue.push(4);
System.out.println(myqueue.pop());
System.out.println(myqueue.pop());
System.out.println(myqueue.pop());
System.out.println(myqueue.pop());
}
结果1234