两个栈模拟队列

package java程序员面试笔试宝典;


import java.util.Stack;


public class 题8_2_5两个栈模拟队列<E> {
private Stack<E> st1=new Stack<E>();
private Stack<E> st2=new Stack<E>();
public synchronized boolean isEmpty(){
return st1.isEmpty()&&st2.isEmpty();
}

public synchronized void put(E data){
st2.push(data);
}

public synchronized E pop(){
if(this.isEmpty()){
return null;
}
if(st1.isEmpty()){
while(!st2.isEmpty()){
st1.push(st2.pop());
}
}
return st1.pop();
}
public synchronized int size(){
return st1.size()+st2.size();
}
public static void main(String[] args) {
题8_2_5两个栈模拟队列<Integer> q=new 题8_2_5两个栈模拟队列<Integer>();
System.out.println(q.size());
q.put(12);
q.put(10);
q.put(9);
System.out.println(q.pop());
System.out.println(q.pop());
System.out.println(q.pop());
System.out.println(q.pop());
System.out.println(q.pop());
}
}