Implement Stack using Queues

题目：

Implement the following operations of a stack using queues.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• empty() -- Return whether the stack is empty.

Notes:

• You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid. 
• Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
• You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).

题意：

就是用队列来实现栈，与之前的某一题用栈来实现队列类似。都是采用双队列来实现，首先是插入，因为队列是先入先出，所以当一个节点插入时，首先将其插入到空的一个队列里，始终保持一个队列为空；然后如果需要pop时，那么就看哪一个队列不为空，在不为空的队列中，一次将节点插入到另一个不为空的队列中，然后考虑只剩下最后一个节点时，将这个节点返回，它就是需要pop出的那个节点。

class MyStack 
{
    // Push element x onto stack.
    Queue<Integer> q1 = new LinkedList<Integer>();
    Queue<Integer> q2 = new LinkedList<Integer>();
    int n;
    public void push(int x) 
    {
        if(q1.isEmpty() && q2.isEmpty())  //这里需要多考虑几种情况，那就是一定要让其中某一个队列为空
           q1.add(x);
        else if(q1.isEmpty() && !q2.isEmpty())
           q2.add(x);
        else if(!q1.isEmpty() && q2.isEmpty())
           q1.add(x);
        n = x;
    }

    // Removes the element on top of the stack.
    public void pop() 
    {
        if(!q1.isEmpty())
        {
            while(q1.size() > 1)
            {
                int front = q1.peek();
                if(q1.size() == 2)
                {
                    n = front;
                }
                q1.poll();
                q2.add(front);
            }
            q1.poll();
        }
        else if(q1.isEmpty() && !q2.isEmpty())
        {
            while(q2.size() > 1)
            {
                int front = q2.peek();
                if(q2.size() == 2)
                {
                    n = front;
                }
                q2.poll();
                q1.add(front);
            }
            q2.poll();
        }
    }

    // Get the top element.
    public int top() 
    {
        return n;
    }

    // Return whether the stack is empty.
    public boolean empty() 
    {
        return (q1.isEmpty() && q2.isEmpty());
    }
}