#include <stdio.h>
#define MAXSIZE 100
typedef int Elemtype;
typedef int Status;
//循环队列顺序存储结构
typedef struct
{
Elemtype data[MAXSIZE];
int front;
int rear;
}SqQueue;
//循环队列初始化
void InitQueue(SqQueue *Q)
{
Q->front = 0;
Q->rear = 0;
}
//循环队列的长度
int QueueLength(SqQueue *Q)
{
return (Q->rear - Q->front + MAXSIZE) % MAXSIZE;
}
//判断队列是否满
int QueueFull(SqQueue *Q)
{
if((Q->rear + 1) % MAXSIZE == Q->front)
return 1;
return 0;
}
//判断队列是否为空
int QueueEmpty(SqQueue *Q)
{
if(Q->rear == Q->front)
return 1;
return 0;
}
//循环队列入
#define MAXSIZE 100
typedef int Elemtype;
typedef int Status;
//循环队列顺序存储结构
typedef struct
{
Elemtype data[MAXSIZE];
int front;
int rear;
}SqQueue;
//循环队列初始化
void InitQueue(SqQueue *Q)
{
Q->front = 0;
Q->rear = 0;
}
//循环队列的长度
int QueueLength(SqQueue *Q)
{
return (Q->rear - Q->front + MAXSIZE) % MAXSIZE;
}
//判断队列是否满
int QueueFull(SqQueue *Q)
{
if((Q->rear + 1) % MAXSIZE == Q->front)
return 1;
return 0;
}
//判断队列是否为空
int QueueEmpty(SqQueue *Q)
{
if(Q->rear == Q->front)
return 1;
return 0;
}
//循环队列入