队列的几种操作

#define _CRT_SECURE_NO_WARNINGS

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

#define Maxsize 5

typedef int elemtype;
typedef struct {
	elemtype data[Maxsize];//能存储Maxsize-1个元素
	int front, rear;
}SqQueue;//定义循环队列
void InitSqQueue(SqQueue& Q) {
	Q.front = Q.rear = 0;
}//初始化循环队列，使队头队尾均指向0
bool isEmpty(SqQueue Q) {
	if (Q.front == Q.rear)
	{return true; }
	else {
		return false;
	}
}//判断队列是否为空，若front与rear相等即为空
bool EnQueue(SqQueue& Q, elemtype m) {
	if ((Q.rear+1)%Maxsize==Q.front ) {
		return false;
	}//判断是否队满
	Q.data[Q.rear] = m;
	Q.rear= (Q.rear + 1) % Maxsize;  
	return true;
}//元素入队

bool DeQueue(SqQueue& Q, elemtype &m) {
	if (Q.rear == Q.front) {
		return false;
	}
	m = Q.data[Q.front];
	Q.front = (Q.front + 1) % Maxsize;
	return true;
}//元素出队

int main() {
	SqQueue Q;
	bool ret;//存储返回值
	elemtype m;
	InitSqQueue(Q);//初始化循环队列
	ret = isEmpty(Q);
	if (ret) {
		printf("队列为空\n");
	}
	else {
		printf("队列不为空\n");
	}//判断队列是否为空
	EnQueue(Q, 3);
	EnQueue(Q, 4);
	EnQueue(Q, 5);
	ret=EnQueue(Q, 6);
	if (ret) {
		printf("入队成功\n");
	}
	else {
		printf("入队失败\n");
	}
	ret = EnQueue(Q, 7);
	if (ret) {
		printf("入队成功\n");
	}
	else {
		printf("入队失败\n");
	}//元素入队
	ret = DeQueue(Q, m);
	if (ret) {
		printf("出队成功，元素为%d\n",m);
	}
	else {
		printf("入队失败\n");
	}
	ret = DeQueue(Q, m);
	if (ret) {
		printf("出队成功，元素为%d\n", m);
	}
	else {
		printf("入队失败\n");
	}//元素出队
	return 0;
}