队列的插入和删除

代码如下：

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef struct Queue{
    int *data;
    int head,tail,length,cnt;
} Queue;

Queue *init(int n)
{
    Queue *q =(Queue *)malloc(sizeof(Queue));
    q->data = (int *)malloc(sizeof(int)*n);
    q->length =n;
    q->head =q->tail =0;
    q->cnt =0;
    return q;
}
int front(Queue *q){
    return q->data[q->head];
}

int empty(Queue *q){
    return q->cnt == 0;
}
int push(Queue *q,int val){
    if(q==NULL) return 0;
    if(q->cnt==q->length) return 0;
    q->data[q->tail++] =val;
    if(q->tail == q->length)  q->tail =0;
    q->cnt++;
    return 1;
}
int pop(Queue *q){
    if(q==NULL) return 0;
    if(empty(q)) return 0;
    q->head++;
    if(q->head ==q->length) q->head=0;
    q->cnt--;
    return 1;
}
void output(Queue *q){
    if(q==NULL) return ;
    printf("Queue : [");
    for(int i=q->head,j=0;j< q->cnt;i++,j++)
    {
        j &&printf(", ");
        printf("%d",q->data[i%q -> length]);
    }
    printf("]\n");
    return;
}
void clear(Queue *q){
    if(q==NULL) return;
    free(q->data);
    free(q);
    return;
}
int main()
{
    srand(time(0));
    #define max_op 10
    Queue *q =init(max_op);
    for(int i =0;i<15;i++)
    {
        int val=rand()%100;
        int op =rand()%5;
        switch(op){
            case 0:
            case 1:
            case 2:
            case 3:{
                printf("push %d to the Queue!",val);
                printf("result = %d\n",push(q,val));
            }break;
            case 4:{
                printf("pop %d from the Queue",front(q));
                printf("result = %d\n",pop(q));
            }break;
            
        }
        output(q),printf("\n");
    }
    #undef max_op
    clear(q);
    return 0;
}

执行结果：

循环队列扩容

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef struct Queue{
    int *data;
    int head,tail,length,cnt;
} Queue;

Queue *init(int n)
{
    Queue *q =(Queue *)malloc(sizeof(Queue));
    q->data = (int *)malloc(sizeof(int)*n);
    q->length =n;
    q->head =q->tail =0;
    q->cnt =0;
    return q;
}
int front(Queue *q){
    return q->data[q->head];
}

int empty(Queue *q){
    return q->cnt == 0;
}
int expand(Queue *q)
{
    int extr_size =q->length;
    int *p;
    while(extr_size)
    {
        p=(int*)malloc(sizeof(int) *(q->length + extr_size));
        if(p) break;
        extr_size >>=1;
    }
    if(p ==NULL) return 0;
    for(int i =q->head ,j=0; j<q->cnt;j++)
    {
        p[j] =q->data[(i+j)% q->length];
    }
    free(q->data);
    q->data =p;
    q->length += extr_size;
    q->head =0;
    q->tail =q->cnt;
    return 1;
}
int push(Queue *q,int val){
    if(q==NULL) return 0;
    if(q->cnt==q->length) {
        if(!expand(q))  return 0;
        printf("expand successfully! Queue->size(%d)\n",q->length);
    }
    q->data[q->tail++] =val;
    if(q->tail == q->length)  q->tail =0;
    q->cnt++;
    return 1;
}
int pop(Queue *q){
    if(q==NULL) return 0;
    if(empty(q)) return 0;
    q->head++;
    if(q->head ==q->length) q->head=0;
    q->cnt--;
    return 1;
}
void output(Queue *q){
    if(q==NULL) return ;
    printf("Queue : [");
    for(int i=q->head,j=0;j< q->cnt;i++,j++)
    {
        j &&printf(", ");
        printf("%d",q->data[i%q -> length]);
    }
    printf("]\n");
    return;
}
void clear(Queue *q){
    if(q==NULL) return;
    free(q->data);
    free(q);
    return;
}
int main()
{
    srand(time(0));
    #define max_op 2
    Queue *q =init(max_op);
    for(int i =0;i<20;i++)
    {
        int val=rand()%100;
        int op =rand()%5;
        switch(op){
            case 0:
            case 1:
            case 2:
            case 3:{
                printf("push %d to the Queue!",val);
                printf("result = %d\n",push(q,val));
            }break;
            case 4:{
                printf("pop %d from the Queue",front(q));
                printf("result = %d\n",pop(q));
            }break;
            
        }
        output(q),printf("\n");
    }
    #undef max_op
    clear(q);
    return 0;
}

这次不能使用realloc进行扩容

• 循环队列的尾可能不在头的后面，而是尾和头重合了
  

• 而用malloc，就可以手动将head调整为索引0，如下，关键在于头尾指针的调整！