- #include <stdio.h>
- #include <malloc.h>
- #include "sqqueue.h"
- int main()
- {
- ElemType a,x;
- SqQueue *qu; //定义队列
- InitQueue(qu); //队列初始化
- while (1)
- {
- printf("输入a值(输入正数进队,负数出队,0结束):");
- scanf("%d", &a);
- if (a>0)
- {
- if (!enQueue(qu,a))
- printf(" 队列满,不能入队\n");
- }
- else if (a<0)
- {
- if (!deQueue(qu, x))
- printf(" 队列空,不能出队\n");
- }
- else
- break;
- }
- return 0;
- }
- <span style="color:#ff0000;">sqqueue.cpp</span>
- #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;
- }
- <span style="color:#ff0000;">sqqueue.h</span>
- #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); //出队