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.

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

java中的LinkedList实现了Queue接口，可以直接使用。
queue提供了offer()方法和poll()方法，用于加入元素和删除队首元素。
尽量使用offer()和poll()，而不是用Collections接口的add()和remove()。因为当队列已满，或者队列为空时，我们使用add()或remove()会返回异常，而offer()和poll()不会返回异常。
——————————————————————————————————————————
add ：在尾部加入一个元索，如果队列已满，则抛出一个IIIegaISlabEepeplian异常
remove ： 删除并返回队列头部的元素，如果队列为空，则抛出一个NoSuchElementException异常
offer ：添加一个元素并返回true， 如果队列已满，则返回false
poll ：删除并返问队列头部的元素， 如果队列为空，则返回null
——————————————————————————————————————————

public class MyStack {
    Queue<Integer> queue;
    int top;
    /** Initialize your data structure here. */
    public MyStack() {
         queue = new LinkedList<>();
    }

    /** Push element x onto stack. */
    public void push(int x) {
        queue.offer(x);
        top = x;
    }

    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        int len = queue.size(), i = 1;
        while(i < len) {
            this.push(queue.poll());
            i++;
        }
        return queue.poll();
    }

    /** Get the top element. */
    public int top() {
        if(queue.isEmpty()) return -1;
        return this.top;
    }

    /** Returns whether the stack is empty. */
    public boolean empty() {
        return queue.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();
 */