#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXLEN 100
//栈的数据类型
typedef char QElemType ;
//队列的顺序存储,循环队列的数据类型C语言描述
typedef struct
{
int front; //指向对头的位置
int rear; //指向对尾的下一个元素的位置
int queueSize; //队列的容量
QElemType data[MAXLEN]; //存放对量数据元素的数组;
}SqQueue;
//1.初始化操作
int initSqQueue(SqQueue *LQ)
{
LQ->front=LQ->rear=0;
LQ->queueSize=MAXLEN;
return 1;
}
//2.判断队空
int SqQueueEmpty(SqQueue Q)
{
if(Q.front==Q.rear)return 1;
else return 0;
}
//3.求队列长度
int SqQueueLength(SqQueue Q)
{
return (Q.rear-Q.front+Q.queueSize)%Q.queueSize;
}
//4.得到队头
int SqGetHead(SqQueue Q,QElemType *e)
{
if(Q.rear==Q.front)return 0;
*e=Q.data[Q.front];
return 1;
}
//5.进队列
int SqEnQueue(SqQueue *LQ,QElemType e)
{
if((LQ->rear+1)%LQ->queueSize==LQ->front) return 0;
LQ->data[LQ->rear]=e;
LQ->rear=(LQ->rear+1)%LQ->queueSize;
printf("after Enqueue %c:front %d,rear %d\n",e,LQ->front,LQ->rear);
return 1;
}
//6.出队列
int SqDeQueue(SqQueue *LQ,QElemType *e)
{
if(LQ->front==LQ->rear) return 0;
*e=LQ->data[LQ->front];
LQ->front=(LQ->front+1)%LQ->queueSize;
printf("after Dequeue %c:front %d,rear %d\n",*e,LQ->front,LQ->rear);
return 1;
}
//7.遍历队列
void SqQueueTraverse(SqQueue Q)
{
int p=Q.front;
printf("\nSqQueueTraverse:\n");
while(p!=(Q.rear)%Q.queueSize)
{
printf("%c,front %d,rear %d,queueSize %d\n",Q.data[p],Q.front,Q.rear,Q.queueSize);
p=(p+1)%Q.queueSize;
}
printf("\n");
}
void main()
{
SqQueue Q;
QElemType a='A',b='B',c='C';
initSqQueue(&Q);
SqEnQueue(&Q,a);SqEnQueue(&Q,b);SqEnQueue(&Q,c);
SqQueueTraverse(Q);
SqDeQueue(&Q,&a);
SqQueueTraverse(Q);
}
运行结果