【Leetcode】232. Implement Queue using Stacks

思路：

入队：栈a若不满，则直接压入栈in。

出队：若out空就将in中的所有元素弹出到栈b中，然后out出栈；若out不空就直接从out中弹出元素。

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

/**
 * 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();
 */

Runtime：106ms