每日刷题系列---225. Implement Stack using Queues

编写一个类，用队列来实现栈，支持栈的基本操作（push,pop,peek,empty）

原题目：LeetCode 225. 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.

Example:

MyStack stack = new MyStack();

stack.push(1);
stack.push(2);  
stack.top();   // returns 2
stack.pop();   // returns 2
stack.empty(); // returns false

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).

设计思路：不同于用栈来实现队列，我们可以很容易的用队列来实现栈。因为队列是先进先出的数据结构，而栈是先进后出的数据结构，如果我们将新加入队列的元素想办法把它弄到队列头部，这样下次从队列中删除元素的时候就是刚加入的元素，于是我们就使用队列实现了先进后出的数据结构。现在就是怎么将新加入的元素弄到队列的队头了？其实很简单，我们只需要依次删除队头的元素，并将其重新加入到队列尾部，直到队头元素是新加入的元素即可。

下面看实现代码：

class MyStack {
    private Queue<Integer> queue;

    /** Initialize your data structure here. */
    public MyStack() {
        queue = new ArrayDeque<>();
    }
    
    /** Push element x onto stack. */
    public void push(int x) {
        queue.add(x);
        for (int i = 1; i < queue.size(); i++) {
            queue.add(queue.poll());
        }
    }
    
    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        return queue.poll();
    }
    
    /** Get the top element. */
    public int top() {
        return queue.peek();
    }
    
    /** Returns whether the stack is empty. */
    public boolean empty() {
        return queue.isEmpty();
    }
}

我们下期见！