问题及代码:
1.头文件:sqqueue.h,包含定义顺序环形队列数据结构的代码、宏定义、要实现算法的函数的声明;
- #ifndef SQQUEUE_H_INCLUDED
- #define SQQUEUE_H_INCLUDED
-
- #define MaxSize 5
- typedef char ElemType;
- typedef struct
- {
- ElemType data[MaxSize];
- int front,rear;
- } SqQueue;
-
-
- void InitQueue(SqQueue *&q);
- void DestroyQueue(SqQueue *&q);
- bool QueueEmpty(SqQueue *q);
- int QueueLength(SqQueue *q);
- bool enQueue(SqQueue *&q,ElemType e);
- bool deQueue(SqQueue *&q,ElemType &e);
-
- #endif // SQQUEUE_H_INCLUDED
2.源文件:sqqueue.cpp,包含实现各种算法的函数的定义
- #include <stdio.h>
- #include <malloc.h>
- #include "sqqueue.h"
-
- void InitQueue(SqQueue *&q)
- {
- q=(SqQueue *)malloc (sizeof(SqQueue));
- q->front=q->rear=0;
- }
- void DestroyQueue(SqQueue *&q)
- {
- free(q);
- }
- bool QueueEmpty(SqQueue *q)
- {
- return(q->front==q->rear);
- }
-
-
- int QueueLength(SqQueue *q)
- {
- return (q->rear-q->front+MaxSize)%MaxSize;
- }
-
- bool enQueue(SqQueue *&q,ElemType e)
- {
- if ((q->rear+1)%MaxSize==q->front)
- return false;
- q->rear=(q->rear+1)%MaxSize;
- q->data[q->rear]=e;
- return true;
- }
- bool deQueue(SqQueue *&q,ElemType &e)
- {
- if (q->front==q->rear)
- return false;
- q->front=(q->front+1)%MaxSize;
- e=q->data[q->front];
- return true;
- }
3.在同一项目(project)中建立一个源文件(如main.cpp),编制main函数,完成相关的测试工作。 例:
- #include <stdio.h>
- #include "sqqueue.h"
-
- int main()
- {
- ElemType e;
- SqQueue *q;
- printf("(1)初始化队列q\n");
- InitQueue(q);
- printf("(2)依次进队列元素a,b,c\n");
- if (enQueue(q,'a')==0) printf("队满,不能进队\n");
- if (enQueue(q,'b')==0) printf("队满,不能进队\n");
- if (enQueue(q,'c')==0) printf("队满,不能进队\n");
- printf("(3)队列为%s\n",(QueueEmpty(q)?"空":"非空"));
- if (deQueue(q,e)==0)
- printf("队空,不能出队\n");
- else
- printf("(4)出队一个元素%c\n",e);
- printf("(5)队列q的元素个数:%d\n",QueueLength(q));
- printf("(6)依次进队列元素d,e,f\n");
- if (enQueue(q,'d')==0) printf("队满,不能进队\n");
- if (enQueue(q,'e')==0) printf("队满,不能进队\n");
- if (enQueue(q,'f')==0) printf("队满,不能进队\n");
- printf("(7)队列q的元素个数:%d\n",QueueLength(q));
- printf("(8)出队列序列:");
- while (!QueueEmpty(q))
- {
- deQueue(q,e);
- printf("%c ",e);
- }
- printf("\n");
- printf("(9)释放队列\n");
- DestroyQueue(q);
- return 0;
- }
运行结果:
![](https://img-blog.csdn.net/20151012161455180?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)