循环队列的实现

#include<iostream>
using namespace std;
#define MAXQSIZE 100
#define OK 1
#define ERROR 0
typedef char QElemType;
typedef char SElemType;
typedef struct {
	QElemType* base; //初始化时动态分配存储空间
	int front;  //头指针
	int rear;  //尾指针
}SqQueue;
//循环队列初始化
int InitQueue(SqQueue& Q)
{
	Q.base = new QElemType[MAXQSIZE];
	if (!Q.base)
	{
		exit(0);
	}
	Q.front = Q.rear = 0;
	return OK;
}
//求循环队列的长度
int QueueLength(SqQueue Q)
{
	return (Q.rear - Q.front + MAXQSIZE) % MAXQSIZE;
}
//循环队列的入队
int EnQueue(SqQueue& Q, QElemType e)
{
	if ((Q.rear + 1) % MAXQSIZE == Q.front)
	{
		return ERROR;
	}
	Q.base[Q.rear] = e;
	Q.rear = (Q.rear + 1) % MAXQSIZE;
	return OK;
}
//循环队列的出队
int DeQueue(SqQueue& Q, QElemType& e)
{
	if (Q.front == Q.rear)
	{
		return ERROR;
	}
	e = Q.base[Q.front];
	Q.front = (Q.front + 1) % MAXQSIZE;
	return OK;
}
//取循环队列的队头元素
SElemType GetHead(SqQueue Q)
{
	if (Q.front != Q.rear)
	{
		return Q.base[Q.front];
	}
}
int main()
{
	SqQueue Q;
	QElemType e, j;
	InitQueue(Q);
	cout << "入队的元素依次为：";
	for (int i = 0; i < 5; i++)
	{
		cin >> j;
		EnQueue(Q, j);
		cout << j << " ";
	}
	cout << endl;
	cout << "队头元素为：" << GetHead(Q) << endl;
	cout << "弹出的队头元素为：";
	DeQueue(Q, e);
	cout << e << endl;
	return 0;
}