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

借助两个栈实现，连续插入的时候，每次判断第一个栈是否为空  不为空推出来，插到另一个栈中。插完后，再将另一个栈的结果返回回来，这样就保证了先进先出

class Queue {
public:
     stack<int> que;
    stack<int> temp;
    // Push element x to the back of queue.
    void push(int x) {
        while(!que.empty())
        {
            temp.push(que.top());
            que.pop();
        }
            que.push(x);
        while(!temp.empty())
        {
            que.push(temp.top());
            temp.pop();
        }
    }


    // Removes the element from in front of queue.
    void pop(void) {


        que.pop();
    }
    // Get the front element.
    int peek(void) {
        return que.top();
    }


    // Return whether the queue is empty.
    bool empty(void) {
        return que.empty();
    }
};

法二：笨办法，每次要pop或者要top，就整个放到另一个栈中，做完之后再放回原栈当中

class Queue {
public:
     stack<int> que;
    stack<int> temp;
    // Push element x to the back of queue.
    void push(int x) {
            que.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void) {
        while(!que.empty())
        {
            temp.push(que.top());
            que.pop();
        }
        temp.pop();
        while(!temp.empty())
        {
            que.push(temp.top());
            temp.pop();
        }
    }
    // Get the front element.
    int peek(void) {
        while(!que.empty())
        {
            temp.push(que.top());
            que.pop();
        }
        int tem = temp.top();
        while(!temp.empty())
        {
            que.push(temp.top());
            temp.pop();
        }
        return tem;
    }

    // Return whether the queue is empty.
    bool empty(void) {
        return que.empty()&&temp.empty();
    }
};