用栈实现队列 Q232 Implement Queue using Stacks

本来是很简单的一道题，但是写了半天，因为忘记了stack1.size()是会变的。。。需要取个临时变量。

class MyQueue {
    ArrayDeque<Integer> stack1;
    ArrayDeque<Integer> stack2;

    /** Initialize your data structure here. */
    public MyQueue() {
        stack1 = new ArrayDeque<Integer>();
        stack2 = new ArrayDeque<Integer>();
    }
    
    /** Push element x to the back of queue. */
    public void push(int x) {
        stack1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        int s1 = stack1.size();
        for(int i=0;i < s1;i++){
        stack2.push(stack1.pop());
        }           
        int ret = stack2.pop();
        int s2 = stack2.size();
        for(int i=0;i < s2;i++){
        stack1.push(stack2.pop());
        }    
        return ret;        
    }
    
    /** Get the front element. */
    public int peek() {
        int s1 = stack1.size();
        for(int i=0;i < s1;i++){
        stack2.push(stack1.pop());
        }    
        int ret = stack2.peek();
        int s2 = stack2.size();
        for(int i=0;i < s2;i++){
        stack1.push(stack2.pop());
        }
        return ret;
    }
    
    /** Returns whether the queue is empty. */
    public boolean empty() {
        return stack1.isEmpty();
    }
}

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * boolean param_4 = obj.empty();
 */