Implement Stack using Queues 解答

提示：扫一扫查出行
【扫一扫了解最新限行尾号】
复制提示

Question

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

Solution

Java Queue Interface

Key to the solution is to use two queues. Queue is strictly First In, First Out.

Two Methods

Method 1: making push operation costly

push(s, x) // x is the element to be pushed and s is stack

  1) Enqueue x to q2

  2) One by one dequeue everything from q1 and enqueue to q2.

  3) Swap the names of q1 and q2

// Swapping of names is done to avoid one more movement of all elements

// from q2 to q1. 

pop(s)

  1) Dequeue an item from q1 and return it.

Method 2: making pop operation costly

push(s,  x)

  1) Enqueue x to q1 (assuming size of q1 is unlimited).

pop(s)

  1) One by one dequeue everything except the last element from q1 and enqueue to q2.

  2) Dequeue the last item of q1, the dequeued item is result, store it.

  3) Swap the names of q1 and q2

  4) Return the item stored in step 2.

// Swapping of names is done to avoid one more movement of all elements

// from q2 to q1.

 class MyStack {

     Queue<Integer> queue1;

     Queue<Integer> queue2;

     public MyStack(){

         queue1 = new LinkedList<Integer>();

         queue2 = new LinkedList<Integer>();

     }

     // Push element x onto stack.

     public void push(int x) {

         queue1.add(x);

     }

     // Removes the element on top of the stack.

     public void pop() {

         if (queue1.peek() == null)

             return;

         int length = queue1.size();

         queue2 = new LinkedList<Integer>();

         while (length > 1) {

             queue2.add(queue1.remove());

             length--;

         }

         queue1 = queue2;

     }

     // Get the top element.

     public int top() {

         if (queue1.peek() == null)

             return -1;

         queue2 = new LinkedList<Integer>();

         int length = queue1.size();

         int lastElement = 0;

         while (length > 0) {

             lastElement = queue1.remove();

             queue2.add(lastElement);

             length--;

         }

         queue1 = queue2;

         return lastElement;

     }

     // Return whether the stack is empty.

     public boolean empty() {

         if (queue1.peek() == null)

             return true;

         return false;

     }

 }