数据结构之队列的顺序存储

简单易懂版。
解释在注释，代码如下:

#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
#define N 10
typedef struct Queue {
	char *base;
	int front;//头指针
	int rear;//尾指针
}Queue,*QueuePtr;
void InitQueue(QueuePtr q) {
	q->base = (char *)malloc(sizeof(char) * N);
	if (!q->base) {
		printf("初始化失败!\n");
		return;
	}
	q->front = q->rear = 0;
	printf("初始化成功!\n");
}
void EnQueue(QueuePtr q, char e) {
	if ((q->rear + 1) % N == q->front) {//循环队列判断队是否满
		printf("队列已满，%c 插入失败\n",e);
		return;
	}
	q->base[q->rear] = e;
	q->rear = (q->rear + 1) % N;//移动尾指针
}
void DeQueue(QueuePtr q, char *e) {
	if ((q->rear == q->front)) {
		printf("队已空\n");
		return;
	}
	*e = q->base[q->front];
	q->front = (q->front + 1) % N;
}
void PrintQueue(QueuePtr q) {
	//打印队列元素 写法1：用队列 长度来输出
	int len = (q->rear - q->front + N) % N;//计算队列长度
	for (int i = q->front,j = 0; j < len;j++) {//j为计数器，i为队头指针
		printf("%c\t", q->base[i]);
		i = (i + 1) % N;//循环队列中 对头指针往后移动
	}
	//写法2： 用队头队尾指针来输出
	for (int i = q->front; i != q->rear; i = (i + 1) % N) {
		printf("%c\t", q->base[i]);
	}
	printf("\n");
} 
void EmptyQueue(QueuePtr q) {
	if (q->front == q->rear) {
		printf("队列为空!\n");
		return ;
	}
	else {
		printf("队列不为空!\n");
		return ;
	}
}
void GetFront(QueuePtr q, char *x) {
	if (q->front == q->rear) {
		printf("队为空!\n");
		return;
	}
	*x = q->base[q->front];
}
void Menu() {
	printf("\t\t********************\n");
	printf("\t\t1.初始化队列\n");
	printf("\t\t2.入队\n");
	printf("\t\t3.出队\n");
	printf("\t\t4.判断队列是否为空\n");
	printf("\t\t5.取队头元素\n");
	printf("\t\t6.显示队列元素\n");
	printf("\t\t7.退出\n");
	printf("\t\t********************\n");
}
int main() {
	system("color 9F");
	Queue q;
	InitQueue(&q);
	Menu();
	int select;
	char x;
	int n;
	while (1) {
		puts("请输入数字选择操作:");
		scanf("%d", &select);
		switch (select) {
		case 1:
			InitQueue(&q);
			break;
		case 2:
			puts("请输入要入队的元素的个数：");
			scanf("%d", &n);
			getchar();
			for (int i = 1; i <= n; i++) {
				char x;
				printf("请输入要插入的元素:");
				scanf("%c", &x);
				getchar();
				EnQueue(&q, x);
			}
			break;
		case 3:
			DeQueue(&q, &x);
			printf("出队元素为:%c\n", x);
			break;
		case 4:
			EmptyQueue(&q);
			break;
		case 5:
			GetFront(&q, &x);
			printf("队头元素为: %c \n", x);
			break;
		case 6:
			PrintQueue(&q);
			break;
		case 7:
			return 0;
		}
	}
}