两个栈实现一个队列
import java.util.Stack;
public class Demo07 {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push (int node) {
stack1.push(node);
}
public int pop () {
if (stack2.size()<=0 ){
while (stack1.size()>0 ){
stack2.push(stack1.pop());
}
}
if (stack2.isEmpty()){
try {
throw new Exception("queue is empty." );
} catch (Exception e) {
}
}
/**
* int head = stack2.peek();
* stack2.pop();
*/
int head = stack2.pop();
return head;
}
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
两个队列实现一个栈
import java.util.ArrayDeque;
import java.util.Queue;
public class Demo08 {
Queue<Integer> queue1 = new ArrayDeque<>();
Queue<Integer> queue2 = new ArrayDeque<>();
public void push (int node) {
if (queue1.isEmpty()&&queue2.isEmpty()) {
queue1.add(node);
return ;
}
if (queue1.isEmpty()) {
queue2.add(node);
return ;
}
if (queue2.isEmpty()) {
queue1.add(node);
return ;
}
}
public int pop () {
if (queue1.isEmpty()&&queue2.isEmpty()) {
try {
throw new Exception("stack is empty" );
} catch (Exception e) {
}
}
if (queue1.isEmpty()) {
while (queue2.size()>1 ) {
queue1.add(queue2.poll());
}
return queue2.poll();
}
if (queue2.isEmpty()) {
while (queue1.size()>1 ) {
queue2.add(queue1.poll());
}
return queue1.poll();
}
return (Integer) null ;
}
public static void main (String[] args) {
Demo08 demo08 = new Demo08();
demo08.push(1 );
demo08.push(2 );
demo08.push(3 );
demo08.push(4 );
System.out .println(demo08.pop());
System.out .println(demo08.pop());
demo08.push(5 );
System.out .println(demo08.pop());
System.out .println(demo08.pop());
System.out .println(demo08.pop());
}
}