题目
思路
栈:先进后出
队列:先进先出
使用两个栈,栈1用于push,栈2用于pop,两个栈底相当于是连接的。
代码
import java.util.Stack;
public class Stack2Queue {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
//进队列
public void push(int node) {
stack1.push(node);
System.out.println(node+" push");
}
//出队列
public int pop() {
if(stack1.empty()&&stack2.empty()){
throw new RuntimeException("队列为空");
}
else if(stack2.empty()){
while(!stack1.empty()){
stack2.add(stack1.pop());
}
}
return stack2.pop();
}
public void dispalyPop(){
System.out.println("pop "+this.pop());
}
public static void main(String[] args){
Stack2Queue stack2Queue =new Stack2Queue();
// stack2Queue.pop();
stack2Queue.push(1);
stack2Queue.push(2);
stack2Queue.push(3);
stack2Queue.push(4);
stack2Queue.dispalyPop();
stack2Queue.dispalyPop();
stack2Queue.dispalyPop();
stack2Queue.push(5);
stack2Queue.dispalyPop();
stack2Queue.dispalyPop();
}
}