代码:
#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;
}//of if
paraPtr->data[paraPtr->rear] = paraValue;
paraPtr->rear = (paraPtr->rear + 1) % TOTAL_SPACE;
}//of enqueue
//出队
int dequeue(CircleIntQueuePtr paraPtr) {
int resultValue;
if (paraPtr->front == paraPtr->rear) {
printf("No element in the queue.\r\n");
return - 1;
}//of if
resultValue = paraPtr->data[paraPtr->front];
paraPtr->front = (paraPtr->front + 1) % TOTAL_SPACE;
return resultValue;
}//of dequeue
//输出
void outputCircleIntQueue(CircleIntQueuePtr paraPtr) {
int i;
if (paraPtr->front == paraPtr->rear) {
printf("Empty queue.");
return;
}//of if
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]);
}//of for i
printf("\r\n");
}//of outputCircleIntQueue
void testCircleIntQueue() {
int i = 10;
CircleIntQueuePtr tempPtr = initQueue();
for (; i < 16; i++) {
enqueue(tempPtr, i);
}//of for i
outputCircleIntQueue(tempPtr);
for (i = 0; i < 6; i++) {
printf("dequeue gets %d\r\n", dequeue(tempPtr));
}//of for i
for (i = 3; i < 6; i++) {
enqueue(tempPtr, i);
}//of for i
for (i = 20; i < 30; i++) {
enqueue(tempPtr, i);
printf("dequeue gets %d\r\n", dequeue(tempPtr));
outputCircleIntQueue(tempPtr);
}//of for i
}//of testCircleIntQueue
int main() {
testCircleIntQueue();
return 1;
}//of main
运行结果: