3.7循环队列

初始化：

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

	return resultPtr;
}

入队：

// 入队 
void enqueue(CircleIntQueuePtr paraPtr, int paraValue) {
	if ((paraPtr->tail + 1) % TOTAL_SPACE == paraPtr->head) {
		printf("队列已经满了.\r\n");
		return;
	} 
	paraPtr->data[paraPtr->tail % TOTAL_SPACE] = paraValue;
	paraPtr->tail++;
}

出队：

// 出队 
int dequeue(CircleIntQueuePtr paraPtr) {
	int resultValue;
	if (paraPtr->head == paraPtr->tail) {
		printf("当前队列为空.\r\n");
		return -1;
	} 
	resultValue = paraPtr->data[paraPtr->head % TOTAL_SPACE];
	paraPtr->head++;

	return resultValue;
}

输出：

// 打印队列 
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");
}

完整代码：

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

#define TOTAL_SPACE 5

typedef struct CircleIntQueue{
	int data[TOTAL_SPACE];

	int head;

	int tail;
}*CircleIntQueuePtr;

// 初始化队列 
CircleIntQueuePtr initQueue() {
	CircleIntQueuePtr resultPtr = (CircleIntQueuePtr)malloc(sizeof(struct CircleIntQueue));
	resultPtr->head = 0;
	resultPtr->tail = 0;

	return resultPtr;
}

// 入队 
void enqueue(CircleIntQueuePtr paraPtr, int paraValue) {
	if ((paraPtr->tail + 1) % TOTAL_SPACE == paraPtr->head) {
		printf("队列已经满了.\r\n");
		return;
	} 
	paraPtr->data[paraPtr->tail % TOTAL_SPACE] = paraValue;
	paraPtr->tail++;
}

// 出队 
int dequeue(CircleIntQueuePtr paraPtr) {
	int resultValue;
	if (paraPtr->head == paraPtr->tail) {
		printf("当前队列为空.\r\n");
		return -1;
	} 
	resultValue = paraPtr->data[paraPtr->head % TOTAL_SPACE];
	paraPtr->head++;

	return resultValue;
}

// 打印队列 
void outputLinkQueue(CircleIntQueuePtr paraPtr){
	int i;
	if (paraPtr->head == paraPtr->tail) {
		printf("空队列.");
		return;
	}
	printf("当前队列存在元素: ");
	for (i = paraPtr->head; i < paraPtr->tail; i++) {
		printf("%d, ", paraPtr->data[i % TOTAL_SPACE]);
	}

	printf("\r\n");
}

// 测试函数 
void testLinkQueue(){
	int i = 10;
	CircleIntQueuePtr tempPtr = initQueue();
	for (; i < 16; i ++) {
		enqueue(tempPtr, i);
	}

	outputLinkQueue(tempPtr);

	for (i = 0; i < 6; i ++) {
		printf("从队列中删除元素：%d\r\n", dequeue(tempPtr));
	}
}

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