225. Implement Stack using Queues（待总结，多种方法）

思路：

设置两个队列queue1，queue2
对pop()操作：将queue1.size()的前n-1个元素放入queue2;将最后一个元素pop（）,即完成了栈的出栈操作；
对top的操作类似对pop的操作。将queue1的前n-1个元素放queue2，读出queue的第n个元素并将其作为返回值，再将其放queue2，然后将queue1和queue2这两个对象变量的引用交换，恢复原样。

class MyStack {

    private Queue<Integer> queue1;
    private Queue<Integer> queue2;

    /** Initialize your data structure here. */
    public MyStack() {
        queue1 = new LinkedList<>();
        queue2 = new LinkedList<>();
    }
    
    /** Push element x onto stack. */
    public void push(int x) {
        queue1.add(x);
    }
    
    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        while(queue1.size()>1)
        {
            int i = queue1.remove();
            queue2.add(i);
        }
        int res = queue1.remove();
        while(!queue2.isEmpty())
        {
            queue1.add(queue2.remove());
        }
        return res;
    }
    
    /** Get the top element. */
    public int top() {
        int size = queue1.size();
        while(size>1)
        {
            queue2.add(queue1.remove());
            size--;
        }
        int res = queue1.peek();
        queue2.add(queue1.remove());
        Queue<Integer> tmp =queue1;
        queue1 = queue2;
        queue2 = tmp;
        return res;
    }
    
    /** Returns whether the stack is empty. */
    public boolean empty() {
        return queue1.isEmpty();
    }
}

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