leetcode 232 Implement Queue using Stacks（难易度：Easy）

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) {
        stack1.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void) {
        if (stack2.size() <= 0) {
			while (stack1.size() > 0) {
				int &data = stack1.top();
				stack1.pop();
				stack2.push(data);
			}
		}
		if (stack2.size() == 0)
			exit(EXIT_FAILURE);
		stack2.pop();
    }

    // Get the front element.
    int peek(void) {
        if (stack2.size() <= 0) {
			while (stack1.size() > 0) {
				int &data = stack1.top();
				stack1.pop();
				stack2.push(data);
			}
		}
		if (stack2.size() == 0)
			exit(EXIT_FAILURE);
		return stack2.top();
    }

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

原题地址： https://leetcode.com/problems/implement-queue-using-stacks/