用数组模拟循环队列代码、队列数组模型

队列的基本操作是：入队和出队

队满条件：(rear+1)%maxsize == front

队空条件：rear == front || size==0

初始条件：front = 0   rear = 0

代码：

#define _CRT_SECURE_NO_WARNINGS
//使用数组来模拟队列
#include<stdio.h>
#include<stdlib.h>

#define SizeOfQuene 10
typedef struct AlignMent* Quene;

struct AlignMent {
	int array[SizeOfQuene];
	//数组
	int Front;
	//指向首元素的位置，队头
	int Rear;
	//指向最后一个元素的位置，队尾
	int Size;
	//队列中元素的个数
};

void Initialize(s);
//初始化队列
int IsEmpty(s);
//判断队列是否为空
int IsFull(s);
//判断队列是否满
void MakeEmpty(s);
//使得队列变为空队列
void EnQueue(s, x);
//入队x
int DeQueue(s);
//执行一次出队操作
void PrintQuene(s);
//打印出队列

void PrintQuene(Quene s)
//打印出队列
{
	printf("目前队列情况为：\n");
	printf("front=%d rear=%d size=%d\n", s->Front, s->Rear, s->Size);

	if (s->Front <= s->Rear)
	{
		int i = s->Front+1;
		for (; i <= s->Rear; i++)
			printf("%d ", s->array[i]);
	}
	else {
		int i = s->Front+1;
		for (; i < SizeOfQuene; i++)
			printf("%d ", s->array[i]);
		for (i = 0; i <= s->Rear; i++)
			printf("%d ", s->array[i]);
	}
	printf("\n");
}

void EnQueue(Quene s, int x)
//将x元素入队
{
	if (IsFull(s) != 0)
	{
		printf("队列满了已经，请不要再执行入队操作");
		exit(0);
	}
	else {
		s->Rear = (s->Rear + 1) % SizeOfQuene;
		s->array[s->Rear] = x;
		s->Size++;
	}
}

int DeQueue(Quene s)
//出队操作
{
	int k = 0;
	if (IsEmpty(s) != 0)
	{
		printf("队列已经空了，无法执行出队操作");
		exit(0);
	}
	else {
		s->Front = (s->Front + 1) % SizeOfQuene;
		 k = s->array[s->Front];
		s->array[s->Front] = 0;
	
	}
	s->Size--;
	return k;
}

void Initialize(Quene s)
//初始化队列
{
	s->Front = 0;
	s->Rear = 0;
	// 则队满的条件是：(front + 1)%size = rear
	// 队空的条件是：front = = rear
	s->Size = 0;
}

int IsEmpty(Quene s)
//判断队列是否为空
{
	return s->Size == 0;
}

int IsFull(Quene s)
//判断队列是否满
{
	return (s->Rear + 1) % SizeOfQuene == s->Front;
}

void MakeEmpty(Quene s)
//使得队列变为空队列
{
	 if (s->Front <= s->Rear)
	{
		while (s->Front <= s->Rear)
		{
			s->array[s->Front] = 0;
			s->Front++;
		}
	}
	else {
		while (s->Front < SizeOfQuene)
		{
			s->array[s->Front] = 0;
			s->Front++;
		}
		while (s->Rear >= 0)
		{
			s->array[s->Rear] = 0;
			s->Rear--;
		}
	}

	s->Front = 0;
	s->Rear = 0;
	s->Size = 0;
}

int main()
{
	Quene s = malloc(sizeof(struct AlignMent));
	Initialize(s);
	//建立并初始化队列（

	printf("welcome use this producer\n");
	printf("输入格式为：a\n");
	printf("a如果为0则表示出队,a为1则表示入队操作，请继续输入入队的数\n");
	printf("a如果为123则表示停止操作，输出队列\n");

	int a = 0;
	scanf("%d", &a);
	while (a != 123)
	{
		if (a == 0)
			//出队
		{
			printf("出队的数是：%d\n",DeQueue(s));
		}
		else if (a == 1)
		{
			int b = 0;
			printf("请输入要入队的数:\n");
			scanf("%d", &b);

			EnQueue(s, b);
		}

		PrintQuene(s);

		printf("请继续输入指令a:");
		scanf("%d", &a);
	}

	printf("最终的队列情况为：\n");
	PrintQuene(s);

	printf("如果想清空队列，请输入数字0，如果想保存，则输入数字1\n");
	printf("请输入:");
	int c = 0;
	scanf("%d", &c);

	if (c == 0) {
		MakeEmpty(s);
		printf("队列清空成功\n");
	}

	printf("最终的队列为：\n");
	PrintQuene(s);

	printf("bye~");
	return 0;
}