11、循环队列

1、建立链表

typedef struct CircleIntQueue{
 
	int data[TOTAL_SPACE];
	int head;
	int tail;
}

2、初始化

CircleIntQueuePtr initQueue() {
	CircleIntQueuePtr resultPtr = (CircleIntQueuePtr)malloc(sizeof(struct CircleIntQueue));
	resultPtr->head = 0;
	resultPtr->tail = 0;
 
	return resultPtr;
}

3、进队列

void enqueue(CircleIntQueuePtr paraPtr, int paraValue) {
	if ((paraPtr->tail + 1) % TOTAL_SPACE == paraPtr->head) {
		printf("Queue full.\r\n");
		return;
	}
 
	paraPtr->data[paraPtr->tail % TOTAL_SPACE] = paraValue;
	paraPtr->tail++;
}

4、出队列

int dequeue(CircleIntQueuePtr paraPtr) {
	int resultValue;
	if (paraPtr->head == paraPtr->tail) {
		printf("No element in the queue.\r\n");
		return -1;
	}
 
	resultValue = paraPtr->data[paraPtr->head % TOTAL_SPACE];
	paraPtr->head++;
 
	return resultValue;
}

5、打印

void outputLinkQueue(CircleIntQueuePtr paraPtr){
	int i;
	if (paraPtr->head == paraPtr->tail) {
		printf("Empty queue.");
		return;
	}
 
	printf("Elements in the queue: ");
	for (i = paraPtr->head; i < paraPtr->tail; i++) {
		printf("%d, ", paraPtr->data[i % TOTAL_SPACE]);
	}
 
	printf("\r\n");
}

6、测试

void testLinkQueue(){
	int i = 10;
	CircleIntQueuePtr tempPtr = initQueue();
	for (; i < 16; i ++) {
		enqueue(tempPtr, i);
	}
 
	outputLinkQueue(tempPtr);
 
	for (i = 0; i < 6; i ++) {
		printf("dequeue gets %d\r\n", dequeue(tempPtr));
	}
 
	enqueue(tempPtr, 8);
	outputLinkQueue(tempPtr);
}