循环队列

循环队列：空出一个元素的大小来判断是否队列满

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning (disable:4996)

#define OK 0
#define ERROR -1

#define M 10
typedef int elemtype;
typedef int status;
typedef struct {
	elemtype *base;
	int front;
	int rear;
}sqqueue;

status initqueue(sqqueue *q) {
	if (q == NULL)return ERROR;
	q->base = (elemtype *)malloc(sizeof(elemtype)*M);
	if (!q->base)return ERROR;
	q->front = q->rear = 0;
	return OK;
}

status destroyqueue(sqqueue *q) {
	if (q == NULL)return ERROR;
	if (q->base) {
		free(q->base);
		q->base = NULL;
	}
	q->front = q->rear = 0;
	return OK;
}

status enqueue(sqqueue *q,elemtype e) {
	if (q == NULL) return ERROR;
	if (q->rear + 1 % M == q->front)return ERROR; //判断是否队列满
	q->base[q->rear] = e;
	q->rear = (q->rear + 1) % M; //*
	return OK;
}

status dequeue(sqqueue *q, elemtype *e) {
	if (q == NULL || e == NULL) return ERROR;
	if (q->rear == q->front)return ERROR; //判断是否队列空
	*e = q->base[q->front];
	q->front = (q->front + 1) % M; //*
	return OK;
}