数据结构（C语言） -- 循环队列demo

最新推荐文章于 2024-05-20 22:31:31 发布

Super小白&

最新推荐文章于 2024-05-20 22:31:31 发布

阅读量36

点赞数

文章标签：数据结构

本文链接：https://blog.csdn.net/weixin_44977283/article/details/131991511

版权

循环队列demo

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

#define MAXSIZE 15
#define FULL 1
#define NONFULL 0
#define EMPTY 3
#define NONEMPTY 2

typedef struct CircularQueue
{
    int front;
    int rear;
    int data[MAXSIZE];
} CircularQueue;

CircularQueue *initQueue()
{
    CircularQueue *CirQueue = (CircularQueue *)malloc(sizeof(CircularQueue));
    CirQueue->front = CirQueue->rear = 0;
    return CirQueue;
}

void printQueue(CircularQueue *CirQueue)
{
    printf("遍历队列 > ");
    int length = (CirQueue->rear - CirQueue->front + MAXSIZE) % MAXSIZE;
    int index = CirQueue->front;
    for (int i = 0; i < length; i++)
    {
        printf("%d -> ", CirQueue->data[index]);
        index = (index + 1) % MAXSIZE;
    }
    printf("OVER\n");
}

int isFull(CircularQueue *CirQueue)
{
    if ((CirQueue->rear + 1) % MAXSIZE == CirQueue->front)
    {
        return FULL;
    }
    else
    {
        return NONFULL;
    }
}

int isEmpty(CircularQueue *CirQueue)
{
    if (CirQueue->front == CirQueue->rear)
    {
        return EMPTY;
    }
    else
    {
        return NONEMPTY;
    }
}

int enCircularQueue(CircularQueue *CirQueue, int data)
{
    if (isFull(CirQueue) == FULL)
    {
        return 0;
    }
    else
    {
        CirQueue->data[CirQueue->rear] = data;
        CirQueue->rear = (CirQueue->rear) + 1 % MAXSIZE;
        printf("%d 入队\n", data);
        return 1;
    }
}

int deCircularQueue(CircularQueue *CirQueue)
{
    if (isEmpty(CirQueue) == EMPTY)
    {
        printf("队列为空！");
    }
    else
    {
        int data = CirQueue->data[CirQueue->front];
        CirQueue->front = (CirQueue->front + 1) % MAXSIZE;
        return data;
    }
}

int main(int argc, char const *argv[])
{
    CircularQueue *CirQueue = initQueue();
    for (int i = 0; i <= 10; i++)
    {
        enCircularQueue(CirQueue, i);
    }
    printf("----------------------------------------------------------\n");
    printQueue(CirQueue);
    printf("----------------------------------------------------------\n");
    for (int i = 0; i <= 10; i++)
    {
        int data = deCircularQueue(CirQueue);
        printf("当前 %d 出队\n", data);
    }
    printf("----------------------------------------------------------\n");
    printQueue(CirQueue);
    return 0;
}

运行结果：

superlan@GodFather:~/C_Language/data_structure$ ./a.out 
0 入队
1 入队
2 入队
3 入队
4 入队
5 入队
6 入队
7 入队
8 入队
9 入队
10 入队
----------------------------------------------------------
遍历队列 > 0 -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10 -> OVER
----------------------------------------------------------
当前 0 出队
当前 1 出队
当前 2 出队
当前 3 出队
当前 4 出队
当前 5 出队
当前 6 出队
当前 7 出队
当前 8 出队
当前 9 出队
当前 10 出队
----------------------------------------------------------
遍历队列 > OVER