Leetcode学习笔记（五）化栈为队

题目：实现一个MyQueue类，该类用两个栈来实现一个队列。

示例：

MyQueue queue = new MyQueue();

queue.push(1);
queue.push(2);
queue.peek();  // 返回 1
queue.pop();   // 返回 1
queue.empty(); // 返回 false

思路：可以用两个栈来模拟，入队时直接往第一个栈push,出队时将第一个栈中数据拿出来放入第二个栈中，这样第二个栈top位就是所需出队值。

注意：再次入队时务必将第二个栈中数据拿回第一个栈中 

class MyQueue {
    stack<int> num_stack;
    stack<int> tmp_stack;
public:
    /** Initialize your data structure here. */
    MyQueue() {    
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        while (!tmp_stack.empty()){
            num_stack.push(tmp_stack.top());
            tmp_stack.pop();
        }
        num_stack.push(x);  
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        int i;
        while (num_stack.size() != 0){
            tmp_stack.push(num_stack.top());
            num_stack.pop();
        }
        i = tmp_stack.top();
        tmp_stack.pop();
        return i;
    }
    
    /** Get the front element. */
    int peek() {
        while (num_stack.size() != 0){
            tmp_stack.push(num_stack.top());
            num_stack.pop();
        }
        return tmp_stack.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if (num_stack.empty() && tmp_stack.empty())
            return true;
        else
            return false;
    }
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue* obj = new MyQueue();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->peek();
 * bool param_4 = obj->empty();
 */