C语言循环链式队列的插入，取出，删除

链循环队列的基本操作

用结构体形成循环链，进行队列的基本操作

代码：

#include <stdio.h>
#include <stdlib.h>

#define MAXQSIZE 100

typedef int QElemType;
typedef struct
{
    QElemType *base;
    int front, rear;
} SqQueue;

int InitQueue(SqQueue *Q);
int EnQueue(SqQueue *Q, QElemType e);  //入队
int DeQueue(SqQueue *Q, QElemType *e); //出队
int QueueLength(SqQueue *Q);           //长度

int InitQueue(SqQueue *Q)
{
    Q->base = (QElemType *)malloc(MAXQSIZE * sizeof(QElemType));
    if (!Q->base)
        return 0;
    Q->front = Q->rear = 0;
    return 1;
}

int isempty(SqQueue *Q)
{
    if (Q->front == Q->rear)
        return 1;
    else
        return 0;
}

int EnQueue(SqQueue *Q, QElemType e)
{
    if ((Q->rear + 1) % MAXQSIZE == Q->front)
        return 0;
    Q->base[Q->rear] = e;
    Q->rear = (Q->rear + 1) % MAXQSIZE;
    return 1;
}

int DeQueue(SqQueue *Q, QElemType *e) //出队
{
    if (Q->front == Q->rear)
        return 0;
    *e = Q->base[Q->front];
    Q->front = (Q->front + 1) % MAXQSIZE;
    return 1;
}

int QueueLength(SqQueue *Q)
{
    return (Q->rear - Q->front + MAXQSIZE) % MAXQSIZE;
}

int main()
{
    SqQueue Q;
    QElemType e;
    if (!InitQueue(&Q))
    {
        printf("InitQueue failed\n");
    }
    for (int i = 1; i <= 3; i++)
    {
        if (EnQueue(&Q, i))
        {
            printf("%d push success\n", i);
        }
        else
        {
            printf("%d push failed\n", i);
        }
    }
    int len = QueueLength(&Q);
    printf("the length of queue is: %d\n", len);
    for (int i = 1; i <= len; i++)
    {

        if (DeQueue(&Q, &e))
        {
            printf("%d pop success\n", e);
        }
        else
        {
            printf("%d pop failed\n", e);
        }
    }
}