循环队列C++实现

#include"iostream"
using namespace std;
#define OK 1
#define ERROR 0
#define MAXQSIZE 100
typedef struct
{
	int *base;
	int front;
	int rear;
}SqQueue;
int InitQueue(SqQueue &Q)
{
	Q.base = new int[MAXQSIZE];
	if (!Q.base)
		exit(OVERFLOW);
	Q.front = Q.rear = 0;
	return OK;
}
int EnQueue(SqQueue &Q,int 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,int &e)
{
	if (Q.front == Q.rear)
		return ERROR;
	e = Q.base[Q.front];
	Q.front = (Q.front + 1) % MAXQSIZE;
	return OK;
}
int main()
{
	SqQueue Q;
	int n;
	int e;
	int a;
	InitQueue(Q);
	cout << "队列有多少元素" << endl;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> e;
		EnQueue(Q,e);
	}
	DeQueue(Q,a);
	cout << a << endl;
	system("pause");
	return 0;
}