用两个栈实现队列的操作

public class MyQueue<E> {
    private Stack<E> s1=new Stack<>();
    private Stack<E> s2=new Stack<>();
    public void add(E e){
        s1.push(e);
    }
    public E poll(){
        if(s2.isEmpty()){
            while (!s1.isEmpty()){
                s2.push(s1.pop());
            }
        }
        return s2.pop();
    }
    public boolean isEmpty(){
        return s1.isEmpty()&s2.isEmpty();
    }

    public static void main(String[] args) {
        char[] array={'A','B','C','D','E'};
        MyQueue myQueue=new MyQueue();
        for(int i=0;i<array.length;i++){
           myQueue.add(array[i]);
        }
        while (!myQueue.isEmpty()){
            System.out.println(myQueue.poll());
        }
    }
}

运行结果：

ABCDE
Process finished with exit code 0