365天挑战LeetCode1000题——Day 058 设计循环双端队列

641. 设计循环双端队列

代码实现（自解）

class MyCircularDeque {
private:
    int *arr;
    int size;
    int maxSize;
    int front;
    int rear;
public:
    MyCircularDeque(int k) {
        arr = new int[k];
        size = 0;
        maxSize = k;
        front = 0;
        rear = 0;
    }
    
    bool insertFront(int value) {
        if (isFull()) return false;
        arr[front] = value;
        front = (front + 1) % maxSize;
        size++;
        return true;
    }
    
    bool insertLast(int value) {
        if (isFull()) return false;
        rear -= 1;
        if (rear == -1) rear = maxSize - 1;
        arr[rear] = value;
        size++;
        return true;
    }
    
    bool deleteFront() {
        if (isEmpty()) return false;
        front -= 1;
        if (front == -1) front = maxSize - 1;
        size--;
        return true;
    }
    
    bool deleteLast() {
        if (isEmpty()) return false;
        rear = (rear + 1) % maxSize;
        size--;
        return true;
    }
    
    int getFront() {
        if (isEmpty()) return -1;
        int tmp = front - 1;
        if (tmp == -1) tmp = maxSize - 1;
        return arr[tmp];
    }
    
    int getRear() {
        if (isEmpty()) return -1;
        return arr[rear];
    }
    
    bool isEmpty() {
        return !size;
    }
    
    bool isFull() {
        return size == maxSize;
    }
};

/**
 * Your MyCircularDeque object will be instantiated and called as such:
 * MyCircularDeque* obj = new MyCircularDeque(k);
 * bool param_1 = obj->insertFront(value);
 * bool param_2 = obj->insertLast(value);
 * bool param_3 = obj->deleteFront();
 * bool param_4 = obj->deleteLast();
 * int param_5 = obj->getFront();
 * int param_6 = obj->getRear();
 * bool param_7 = obj->isEmpty();
 * bool param_8 = obj->isFull();
 */