数组实现环形缓冲队列

截取一位博主的示意图：帮助分析

 

思路： 注意队列满的判断方法： 在队尾加一个节点 ，不存储数据，当 tail+1 == head 

typedef struct {
    int* a;
    int k;          // 个数
    int head;
    int tail;
} MyCircularQueue;

MyCircularQueue* myCircularQueueCreate(int k) {
    MyCircularQueue* obj = (MyCircularQueue*)malloc(sizeof(MyCircularQueue));
    obj->a = malloc(sizeof(int)*(k+1));
    obj->head = obj->tail =0;
    obj->k = k;
    return obj;
}
bool myCircularQueueIsFull(MyCircularQueue* obj) {
    int next= obj->tail+1;
    if(next==obj->k+1)
        next=0;
    return next ==  obj->head;
}

bool myCircularQueueIsEmpty(MyCircularQueue* obj) {
    return obj->tail == obj->head;
}
bool myCircularQueueEnQueue(MyCircularQueue* obj, int value) {
    if(myCircularQueueIsFull(obj))
         return false;
     obj->a[obj->tail] = value;
     obj->tail++;
     if(obj->tail == obj->k+1)//边界处理  到达尾的下一个
     {
         obj->tail=0;
     }
     return true;
}

bool myCircularQueueDeQueue(MyCircularQueue* obj) {
      if(myCircularQueueIsEmpty(obj))
           return false;
      ++obj->head;
      if(obj->head ==obj->k+1)
      obj->head=0;
      return  true;
}

int myCircularQueueFront(MyCircularQueue* obj) {
    if(myCircularQueueIsEmpty(obj))
    return -1;
    return obj->a[obj->head];
}

int myCircularQueueRear(MyCircularQueue* obj) {
    if(myCircularQueueIsEmpty(obj))
        return -1;
    int prev = obj->tail-1;
    if(obj->tail==0)
        prev = obj->k;
    return obj->a[prev];
}



void myCircularQueueFree(MyCircularQueue* obj) {
    free(obj->a);
    free(obj);
}

/**
 * Your MyCircularQueue struct will be instantiated and called as such:
 * MyCircularQueue* obj = myCircularQueueCreate(k);
 * bool param_1 = myCircularQueueEnQueue(obj, value);
 
 * bool param_2 = myCircularQueueDeQueue(obj);
 
 * int param_3 = myCircularQueueFront(obj);
 
 * int param_4 = myCircularQueueRear(obj);
 
 * bool param_5 = myCircularQueueIsEmpty(obj);
 
 * bool param_6 = myCircularQueueIsFull(obj);
 
 * myCircularQueueFree(obj);
*/

力扣https://leetcode.cn/problems/design-circular-queue/