1、若队列的最大尺寸为QueueSize,则队列满的条件是(rear+1)%Queue == Q.front
;计算队列长度的公式是:(rear - front + QueueSize)%QueueSize
2、循环队列的顺序存储结构
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define OVERLOW -1
#define FALSE 0
#define ERROR 0
#define OK 1
#define TRUE 1
#define QueueSize 100
typedef int Status;
typedef struct SqQueue
{
int data[QueueSize];
int front;
int rear