循环队列的顺序表示与实现

#pragma once
#include <cstdlib>
#include <iostream>
using namespace std;
#define MAXSIZE 100
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -1
typedef int Status;
typedef char ElementType;
typedef struct {
    
    
	ElementType* base;
	int front;
	int rear;
}SqQueue;
Status initQueue(SqQueue& Q) {
    
    
	Q.base = new ElementType[MAXSIZE];
	if (!Q.base) {
    
    
		exit(OVERFLOW);
	}
	Q.front = 0;
	Q.rear = 0;
	return OK;
}
int queueLenth(SqQueue Q) {
    
    
	return (Q.rear - Q.front + MAXSIZE) % MAXSIZE;
}
Status enQueue(SqQueue& Q, ElementType e) {
    
    
	if ((Q.rear + 1) % MAXSIZE == Q.front) {
    
    
		return ERROR;
	}
	Q.base[Q.rear] = e;
	Q.rear = (Q.rear + 1) % MAXSIZE;
	return OK;
}
Status deQueue(SqQueue& Q, ElementType& e) {
    
    
	if (Q.rear == Q.front) {
    
    
		return ERROR;
	}
	e = Q.base[Q.front];
	Q.front = (Q.front + 1) % MAXSIZE;
	return OK;
}
ElementType getHead(SqQueue Q) {
    
    
	if (Q.front != Q.rear) {
    
    
		return Q.base[Q.front];
	}
}