Challenge LeetCode1000 questions in 365 days - Day 047 Design Circular Queue Circular Queue

622. 设计循环队列

代码实现（首刷自解）

class MyCircularQueue {
    
private:
    int* q;
    int front, rear, size, maxSize; 
public:
    MyCircularQueue(int k) : q(new int[k]), front(0), rear(0), size(0),
    maxSize(k) {
    }
    
    bool enQueue(int value) {
    
        if (isFull()) return false;
        q[rear] = value;
        rear = (rear + 1) % maxSize;
        size++;
        return true;
    }
    
    bool deQueue() {
    
        if (isEmpty()) return false;
        front = (front + 1) % maxSize;
        size--;
        return true;
    }
    
    int Front() {
    
        if (isEmpty()) return -1;
        return q[front];
    }
    
    int Rear() {
    
        if (isEmpty()) return -1;
        return q[(maxSize + rear - 1) % maxSize];
    }
    
    bool isEmpty() {
    
        return !size;
    }
    
    bool isFull() {
    
        return size == maxSize;
    }
};

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