package com.fishercoder.solutions;

import java.util.Stack;

/**
 * 232. Implement Queue using Stacks
 *
 * Implement the following operations of a queue using stacks.

 push(x) -- Push element x to the back of queue.
 pop() -- Removes the element from in front of queue.
 peek() -- Get the front element.
 empty() -- Return whether the queue is empty.

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

    public static class Solution1 {
        class MyQueue {

            Stack<Integer> input = new Stack();
            Stack<Integer> output = new Stack();

            // Push element x to the back of queue.
            public void push(int x) {
                input.push(x);
            }

            // Removes the element from in front of queue.
            public int pop() {
                peek();
                return output.pop();
            }

            // Get the front element.
            public int peek() {
                if (output.isEmpty()) {
                    while (!input.isEmpty()) {
                        output.push(input.pop());
                    }
                }
                return output.peek();
            }

            // Return whether the queue is empty.
            public boolean empty() {
                return input.isEmpty() && output.isEmpty();
            }
        }
    }
}


@@ -58,771 +58,8 @@
 k;%0A%0A
-/**%0A * 232. Implement Queue using Stacks%0A *%0A * Implement the following operations of a queue using stacks.%0A%0A push(x) -- Push element x to the back of queue.%0A pop() -- Removes the element from in front of queue.%0A peek() -- Get the front element.%0A empty() -- Return whether the queue is empty.%0A%0A Notes:%0A You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.%0A Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.%0A You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).%0A */%0A
 publ

refactor 232