232 Implement Queue using Stacks

题目链接：https://leetcode.com/problems/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).

解题思路：
1、建立两个栈，一个负责push，一个负责pop。
2、当访问peek()和pop()时，只有当负责pop的栈为空时，才从负责push的栈中往pop的栈倒数据。

class MyQueue {
    Stack<Integer> s_1 = new Stack();
    Stack<Integer> s_2 = new Stack();
    // Push element x to the back of queue.
    public void push(int x) {
        s_1.push(x);
    }

    // Removes the element from in front of queue.
    public void pop() {
        if(s_2.isEmpty()) {
            while(!s_1.empty()) {
                s_2.push(s_1.peek());
                s_1.pop();
            }
        }
        s_2.pop();
    }

    // Get the front element.
    public int peek() {
        if(s_2.empty()) {
            while(!s_1.empty()) {
                s_2.push(s_1.peek());
                s_1.pop();
            }
        }
        return s_2.peek();
    }

    // Return whether the queue is empty.
    public boolean empty() {
        if(s_1.empty() && s_2.empty())
            return true;
        else
            return false;
    }
}

17 / 17 test cases passed.
Status: Accepted
Runtime: 176 ms