#栈与队列 #用栈实现队列

implement-queue-using-stacks.cpp

class MyQueue {
public:
    MyQueue() {

    }
    
    void push(int x) {
        my_deque_.push_back(x);
    }
    
    int pop() {
        int i = my_deque_.front(); 
        my_deque_.pop_front();
        return i;
    }
    
    int peek() {
        return my_deque_.front();
    }
    
    bool empty() {
        return my_deque_.empty();
    }
private:
    deque<int> my_deque_;
};

/**
 * 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();
 */