数据结构 C 代码 3.7: 循环队列

摘要: 循环队列能够很好地利用空间.

1. 代码

先上代码, 再说废话.

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

#define TOTAL_SPACE 5

/**
 * Circle int queue.
 */
typedef struct CircleIntQueue{
	int data[TOTAL_SPACE];

	int front;

	int rear;
}*CircleIntQueuePtr;

/**
 * Initialize the queue.
 */
CircleIntQueuePtr initQueue() {
	CircleIntQueuePtr resultPtr = (CircleIntQueuePtr)malloc(sizeof(struct CircleIntQueue));
	resultPtr->front = 0;
	resultPtr->rear = 0;

	return resultPtr;
}// Of the first constructor

/**
 * Enqueue.
 * 
 * @param paraValue The value of the new node.
 */
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

/**
 * Dequeue.
 * 
 * @return The value at the front.
 */
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

/**
 * Output the queue.
 */
void outputCircleIntQueue(CircleIntQueuePtr paraPtr){
	int i;
	if (paraPtr->front == paraPtr->rear) {
		printf("Empty queue.");
		return;
	} // Of if

	printf("Elements 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

/**
 * Unit test.
 */
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

/**
 * The entrance.
 */
int main(){
	testCircleIntQueue();
	return 1;
}//Of main

2. 运行结果

Enqueue: 10 Enqueue: 11 Enqueue: 12 Enqueue: 13 Enqueue: 14 Queue full.
Enqueue: 15 Queue full.
Elements in the queue: data[0] = 10, data[1] = 11, data[2] = 12, data[3] = 13,
dequeue gets 10
dequeue gets 11
dequeue gets 12
dequeue gets 13
No element in the queue.
dequeue gets -1
No element in the queue.
dequeue gets -1
Enqueue: 3 Enqueue: 4 Enqueue: 5 Enqueue: 20 dequeue gets 3
Elements in the queue: data[0] = 4, data[1] = 5, data[2] = 20,
Enqueue: 21 dequeue gets 4
Elements in the queue: data[1] = 5, data[2] = 20, data[3] = 21,
Enqueue: 22 dequeue gets 5
Elements in the queue: data[2] = 20, data[3] = 21, data[4] = 22,
Enqueue: 23 dequeue gets 20
Elements in the queue: data[3] = 21, data[4] = 22, data[0] = 23,
Enqueue: 24 dequeue gets 21
Elements in the queue: data[4] = 22, data[0] = 23, data[1] = 24,
Enqueue: 25 dequeue gets 22
Elements in the queue: data[0] = 23, data[1] = 24, data[2] = 25,
Enqueue: 26 dequeue gets 23
Elements in the queue: data[1] = 24, data[2] = 25, data[3] = 26,
Enqueue: 27 dequeue gets 24
Elements in the queue: data[2] = 25, data[3] = 26, data[4] = 27,
Enqueue: 28 dequeue gets 25
Elements in the queue: data[3] = 26, data[4] = 27, data[0] = 28,
Enqueue: 29 dequeue gets 26
Elements in the queue: data[4] = 27, data[0] = 28, data[1] = 29,
Press any key to continue

3. 代码说明

1. 整除的作用.
2. 想像操场跑道里放一队人, 循环的感觉就出来了.
3. 为了区分空队列与满队列, 需要留一个空间. 相当于不允许首尾相连. 还是画个图吧, 否则容易进坑.
4. 用链式结构, 空间的分配与回收由系统做, 用循环队列, 则是自己把控. 想像自己写的是操作系统, 从这个代码可以感受下内存的管理.

---

欢迎留言!