实验3 队列

#include<stdio.h>#include<stdlib.h>#include<malloc.h>#define MAXSIZE 6typedef int QElemType;typedef int Status;//循环队列结构定义typedef struct SqQueue{QElemType *base;int front;int rear;}SqQueue;//构造一个空队列QStatus InitQueue(SqQueue &Q){Q.base=new QElemType[MAXSIZE];if(!Q.base)   return 0;Q.front=Q.rear=0;return 1;}//返回Q的元素个数，即队列的长度int QueueLength(SqQueue &Q){return(Q.rear-Q.front+MAXSIZE)%MAXSIZE;}//插入元素e为Q新的队尾元素Status EnQueue(SqQueue &Q,QElemType e){if((Q.rear+1)%MAXSIZE==Q.front) return 0;Q.base[Q.rear]=e;Q.rear=(Q.rear+1)%MAXSIZE;return 1;}//若队列不空，删除Q的队头元素，用e返回其地址Status DeQueue(SqQueue &Q,QElemType &e){if(Q.front==Q.rear) return 0;e=Q.base[Q.front];Q.front=(Q.front+1)%MAXSIZE;return e;}void PQueue(SqQueue &Q){if(Q.front==Q.rear)        printf("队列为空队列\n");    else        printf("队列不为空队列\n");}//输出循环队列所有元素Status QueueTraverse(SqQueue &Q){int p=Q.front;if(Q.front==Q.rear) return 0;while(p!=Q.rear){printf("%d  ",Q.base[p]);p=(p+1)%MAXSIZE;}}int main(){    printf("先建立一个空的队列\n");SqQueue Q;InitQueue(Q);printf("循环队列长度=%d\n",QueueLength(Q));printf("判断是否为空队列：\n");PQueue(Q);printf("将元素1插入到队尾：\n");EnQueue(Q,1);printf("循环队列长度=%d\n",QueueLength(Q));printf("将元素2插入到队尾：\n");EnQueue(Q,2);printf("循环队列长度=%d\n",QueueLength(Q));printf("遍历输出队列的元素：\n");QueueTraverse(Q);printf("\n判断是否为空队列：\n");PQueue(Q);return 1;}