c顺序队

#include <iostream>
#include <malloc.h>
using namespace std;

#define maxSize 100

typedef struct {
	char data[maxSize];
	int front, rear;
}sqQueue;
//初始化队列
void InitQueue(sqQueue* &q) {
	q = (sqQueue*)malloc(sizeof(sqQueue));
	q->front = q->rear = 0;
}
//销毁队列
void DestroyQueue(sqQueue*& q) {
	free(q);
}
//判断队列是否为空
bool EmptyQueue(sqQueue* q) {
	return (q->front == q->rear);
}
//进队
bool EnterQueue(sqQueue*& q, char c) {
	//判断是否队满
	if ((q->rear+1)%maxSize == q->front)
	{
		return false;
	}
	else {
		q->rear = (q->rear + 1) % maxSize;
		q->data[q->rear] = c;
		return true;
	}
}
//出队
bool OutQueue(sqQueue*& q, char &c) {
	//判断是否队空
	if (q->rear == q->front)
	{
		return false;
	}
	else {
		q->front = (q->front + 1) % maxSize;
		c = q->data[q->front];
		return true;
	}
}
int main() {
	sqQueue* q = NULL;
	char c = '\0';
	InitQueue(q);
	if (!(EnterQueue(q, 'a')))
	{
		cout << "队满了";
	}
	if (!(EnterQueue(q, 'b')))
	{
		cout << "队满了";
	}
	if (!(EnterQueue(q, 'c')))
	{
		cout << "队满了";
	}
	cout << (EmptyQueue(q) ? "空" : "非空") << endl;
	if (OutQueue(q,c) == false)
	{
		cout << "队空，不能出对";
	}
	else {
		cout << c << endl;
	}
	if (!(EnterQueue(q, 'd')))
	{
		cout << "队满了";
	}
	if (!(EnterQueue(q, 'e')))
	{
		cout << "队满了";
	}
	if (!(EnterQueue(q, 'f')))
	{
		cout << "队满了";
	}
	while (!EmptyQueue(q))
	{
		OutQueue(q, c);
		cout << c << ' ';
	}
	cout << endl;
	cout << (EmptyQueue(q) ? "空" : "非空") << endl;
	//释放队列
	DestroyQueue(q);
	return 0;
}