23数据结构循环队列（王道c语言督学营）

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>

#define Maxsize 5
typedef int ElemType;

typedef struct {
	ElemType data[Maxsize];
	ElemType front, rear;
}SqQueue;


//初始化队列
void initQueue(SqQueue &Q)
{
	Q.front = Q.rear = 0;
}

//判空
bool isEmpty(SqQueue Q)
{
	if (Q.front == Q.rear)
		return true;
}

//元素入栈
bool EnQueue(SqQueue& Q, ElemType x)
{
	if ((Q.rear + 1) % Maxsize == Q.front)
		return false;//队列已满了
	Q.data[Q.rear] = x;//队尾入列
	Q.rear = (Q.rear + 1) % Maxsize;
	return true;
}

//出列
bool DeQueue(SqQueue& Q, ElemType &x) {
	if (Q.rear == Q.front)
		return false;//队列已空
	x = Q.data[Q.front];
	Q.front = (Q.front + 1) % Maxsize;
	return true;
}


int main()
{
	SqQueue Q;
	initQueue(Q);
	ElemType element;//存储出队元素
	bool flag;
	flag=isEmpty(Q);
	if (flag)
	{
		printf("\n队列为空\n");
	}
	else
	{
		printf("\n队列不为空\n");
	}

	//入列
	EnQueue(Q, 2);
	EnQueue(Q, 3);
	EnQueue(Q, 4);
	EnQueue(Q, 5);
	EnQueue(Q, 6);//入列个数要小于等于Maxsize-1;
	flag= EnQueue(Q, 6);//入列失败
	if (flag)
	{
		printf("\n入列成功");
	}
	else
	{
		printf("\n入列失败\n");
	}
	
	
	//出列
	DeQueue(Q, element);
	flag = DeQueue(Q, element);
	if (flag)
	{
		printf("\n出队成功\n");
	}
	else
	{
		printf("\n出列失败\n");
	}


	
}