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

Credits:Special thanks to @jianchao.li.fighter for adding this problem and all test cases.

Solution

class MyStack {
     private Queue<Integer> q1;
    private Queue<Integer> q2;

    public MyStack() {
        q1 = new LinkedList<>();
        q2 = new LinkedList<>();
    }

    // Push element x onto stack.
    public void push(int x) {
           if (empty()) {
            q1.add(x);
        } else if (q1.isEmpty()) {
            q2.add(x);
        } else  if (q2.isEmpty()) {
            q1.add(x);
        }
    }

    // Removes the element on top of the stack.
    public void pop() {
        if (!empty()) {
            if (q1.isEmpty()) {
                while (q2.size() != 1) {
                    q1.add(q2.poll());
                }

                q2.poll();
                return;
            }

            if (q2.isEmpty()) {
                while (q1.size() != 1) {
                    q2.add(q1.poll());
                }

                q1.poll();
                return;
            }
        }
    }

    // Get the top element.
    public int top() {
        if (!empty()) {

            if (q1.isEmpty()) {
                while (q2.size() != 1) {
                    q1.add(q2.poll());
                }

                int temp = q2.peek();
                q1.add(temp);
                q2.poll();
                return temp;

            }


            if (q2.isEmpty()) {
                while (q1.size() != 1) {
                    q2.add(q1.poll());
                }

                int temp = q1.peek();
                q2.add(temp);
                q1.poll();
                return temp;
            }

        }
        return -1;

    }

    // Return whether the stack is empty.

    public boolean empty() {
        return q1.isEmpty() && q2.isEmpty();
    }
}