[leetcode][stack] 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).

class Queue {
public:
	// Push element x to the back of queue.
	void push(int x) {
		sta1.push(x);
	}

	// Removes the element from in front of queue.
	void pop(void) {
		if (!sta2.empty()) sta2.pop();
		else if (!sta1.empty()){
			while (!sta1.empty()){
				int tmp = sta1.top();
				sta1.pop();
				sta2.push(tmp);
			}
			sta2.pop();
		}
	}

	// Get the front element.
	int peek(void) {
		if (!sta2.empty()) return sta2.top();
		else if (!sta1.empty()){
			while (!sta1.empty()){
				int tmp = sta1.top();
				sta1.pop();
				sta2.push(tmp);
			}
			return sta2.top();
		}
		return 0;
	}

	// Return whether the queue is empty.
	bool empty(void) {
		return sta1.empty() && sta2.empty();
	}
private:
	stack<int> sta1, sta2;
};