3.7 循环队列

最新推荐文章于 2024-06-22 21:53:36 发布

´631

最新推荐文章于 2024-06-22 21:53:36 发布

阅读量410

点赞数 5

文章标签：算法

本文链接：https://blog.csdn.net/2302_80930981/article/details/138619135

版权

1,代码

#include <stdio.h>
#include <malloc.h>

#define TOTAL_SPACE 5




typedef struct circleIntQueue{
    int data[TOTAL_SPACE];
    
    int front;
    
    int rear;
}*circleIntQueuePtr;




circleIntQueuePtr initQueue() {
    circleIntQueuePtr resultPtr = (circleIntQueuePtr)malloc(sizeof(struct circleIntQueue));
    resultPtr->front = 0;
    resultPtr->rear = 0;
    
    return resultPtr;
}






void enqueue(circleIntQueuePtr paraPtr, int paraValue) {
    printf("Enqueue: %d ", paraValue);
    if ((paraPtr->rear + 1) % TOTAL_SPACE == paraPtr->front) {
        printf("Queue full.\r\n");
        return;
    }
    
    paraPtr->data[paraPtr->rear] = paraValue;
    paraPtr->rear = (paraPtr->rear + 1) % TOTAL_SPACE;
}






int daqueue(circleIntQueuePtr paraPtr) {
    int resultValue;
    if (paraPtr->front == paraPtr->rear) {
        printf("No element in the queue.\r\n");
        return -1;
    }
    
    resultValue = paraPtr->data[paraPtr->front];
    paraPtr->front = (paraPtr->front + 1) % TOTAL_SPACE;
    
    return resultValue;
}




void outputCircleIntQueue(circleIntQueuePtr paraPtr){
    int i;
    if (paraPtr->front == paraPtr->rear) {
        printf("Empty queue.");
        return ;
    }
    
    printf("Element in the queue: ");
    for (i = paraPtr->front; i != paraPtr->rear; i = (i + 1) % TOTAL_SPACE) {
        printf("data[%d] = %d, ", i, paraPtr->data[i]);
    }
    
    printf("\r\n");
}




void testCircleIntQueue() {
    int i = 10;
    circleIntQueuePtr tempPtr = initQueue();
    for (; i < 16; i ++) {
        enqueue(tempPtr, i);
    }
    
    outputCircleIntQueue(tempPtr);
    
    for(i = 0; i < 6; i ++) {
        printf("dequeue gets %d\r\n",daqueue(tempPtr));
    }
    
    for(i = 3; i < 6; i ++) {
        enqueue(tempPtr, i);
    }
    for(i = 20; i < 30; i ++){
        enqueue(tempPtr, i);
        printf("daqueue gets %d\r\n", daqueue(tempPtr));
        outputCircleIntQueue(tempPtr);
    }
}





int main(){
    testCircleIntQueue();
    return 1;
}

2，运行结果