LeetCode 622. 设计循环队列

具体思路：

可以用数组取余模拟，也可以用单链表设置头尾指针进行模拟；

具体代码：

class MyCircularQueue {
public:
    MyCircularQueue(int k) {
        vec.resize(k);
        size=k;
        begin=0;
        end=0;
        full=false;
    }
    
    bool enQueue(int value) {
        if(full)
            return false;
        vec[end]=value;
        end=(end+1)%size;
        if(begin==end)
            full=true;
        return true;
    }
    
    bool deQueue() {
        if(begin==end&&!full){
            return false;
        }
        if(begin==end)
            full=false;
        begin=(begin+1)%size;
        return true;
    }
    
    int Front() {
        if(begin==end&&!full)
            return -1;
        return vec[begin];
    }
    
    int Rear() {
        if(begin==end&&!full)
            return -1;
        int temp=(end+size-1)%size;
        return vec[temp];
    }   
    
    bool isEmpty() {
        if(begin!=end||(begin==end&&full))
            return false;
        return true;
    }
    
    bool isFull() {
        if(begin==end&&full)
            return true;
        return false;
    }
private:
    vector<int>vec;
    int begin;
    int end;
    int size;
    bool full;
};

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue* obj = new MyCircularQueue(k);
 * bool param_1 = obj->enQueue(value);
 * bool param_2 = obj->deQueue();
 * int param_3 = obj->Front();
 * int param_4 = obj->Rear();
 * bool param_5 = obj->isEmpty();
 * bool param_6 = obj->isFull();
 */