leetcode_c++：栈： Implement Queue using Stacks(232)

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

// 两个栈，一个做为前面专门做pop()，一个做为后面的栈，专门做
push(),
// O(1)

---

class Queue {

private:
    stack<int> stack_front;
    stack<int> stack_back;
    void back_to_front(){
        while(!stack_back.empty()){
            stack_front.push(stack_back.top());
            stack_back.pop();
        }
    }
public:
    // Push element x to the back of queue.
    void push(int x) {
        stack_back.push(x);

    }

    // Removes the element from in front of queue.
    void pop(void) {
        if(stack_front.empty())
            back_to_front();
        return stack_front.pop();

    }

    // Get the front element.
    int peek(void) {
        if(stack_front.empty())
            back_to_front();
        return stack_front.top();

    }

    // Return whether the queue is empty.
    bool empty(void) {
        return stack_front.empty() && stack_back.empty();

    }
};