Java 双栈模拟队列 (LC 232)

核心思路:

1. 创建两个栈，主栈和辅助栈，主栈用来存储数据，辅助栈用来调整元素顺序，保证元素先进先出。
2. 当向主栈中添加元素时，首先把主栈中的元素全部加入辅助栈，然后加入该元素，再把辅助栈中的所有元素加入主栈。

class MyQueue {
    private Stack<Integer> stack1;
    private Stack<Integer> stack2;

    /** Initialize your data structure here. */
    public MyQueue() {
        stack1 = new Stack<>();
        stack2 = new Stack<>();
    }
    
    /** Push element x to the back of queue. */
    public void push(int x) {
        while(!stack1.isEmpty()) {
            stack2.push(stack1.pop());
        }
        stack1.push(x);
        while(!stack2.isEmpty()) {
            stack1.push(stack2.pop());
        }
    }
    
    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        return stack1.pop();
    }
    
    /** Get the front element. */
    public int peek() {
        return stack1.peek();
    }
    
    /** Returns whether the queue is empty. */
    public boolean empty() {
        return stack1.isEmpty();
    }
}