Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - CPP - 641. Design Circular Deque

---

題目：


解答：

class MyCircularDeque {
private:
    int sz;
    int rear;
    int front;
    int max_size;
    vector<int> data;

public:
    MyCircularDeque(int k) {
        sz = 0;
        rear = 0;
        front = 0;
        max_size = k;
        data.resize(k);
    }
    
    bool insertFront(int value) {
        if (isFull()) {
            return false;
        }

        front = (front - 1 + max_size) % max_size;
        data[front] = value;
        sz += 1;

        return true;
    }
    
    bool insertLast(int value) {
        if (isFull()) {
            return false;
        }

        data[rear] = value;
        rear = (rear + 1) % max_size;
        sz += 1;

        return true;
    }
    
    bool deleteFront() {
        if (isEmpty()) {
            return false;
        }

        front = (front + 1) % max_size;
        sz -= 1;
        return true;
    }
    
    bool deleteLast() {
        if (isEmpty()) {
            return false;
        }

        rear = (rear - 1 + max_size) % max_size;
        sz -= 1;
        return true;
    }
    
    int getFront() {
        if (isEmpty()) {
            return -1;
        }

        return data[front];
    }
    
    int getRear() {
        if (isEmpty()) {
            return -1;
        }

        return data[(rear - 1 + max_size) % max_size];
    }
    
    bool isEmpty() {
        return sz == 0;
    }
    
    bool isFull() {
        return sz == max_size;
    }
};

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