#include <stdio.h>
#include <stdlib.h>
#define MAXQSIZE 100 //队列最大长度
typedef int QElemType;
typedef struct {
QElemType *base; //初始化动态分配存储空间
int front; //头指针,队列为不空,指向队列头元素
int rese; //尾指针,队列不为空,指向尾元素的下一个位置
}SqQueue;
void InitQueu(SqQueue &Q,QElemType num) { //构造队列
Q.base = (QElemType *)malloc(MAXQSIZE * sizeof(QElemType));
if(!Q.base) {
printf("队列构造失败,程序退出!");
exit(!0);
}
Q.front = Q.rese = 0;
printf("队列初始化完成,队列初始长度为:%d\n",MAXQSIZE);
QElemType e;
printf("请输入出队元素的数量:");
scanf("%d",&num);
for(int i=1;i<=num;i++) {
printf("请输入第%d个队列的元素:",i);
scanf("%d",&e);
Q.base[Q.rese] = e;
Q.rese =(Q.rese + 1) % MAXQSIZE;
}
}
void EnQueue(SqQueue &Q,QElemType e) { //插入元素
if((Q.rese+1)%MAXQSIZE == Q.front) {
printf("队列已满,无法执行插入操作,程序退出!");
exit(!0);
}
printf("\n\n请输入插入队列的元素:");
scanf("%d",&e);
Q.base[Q.rese] = e;
Q.rese =(Q.rese + 1) % MAXQSIZE;
}
void QueueLength(SqQueue Q) { //获取队列长度
QElemType e;
e = (Q.front - Q.rese + MAXQSIZE) % MAXQSIZE;
printf("\n\n当前队列的剩余可用长度为:%d\n",e);
}
void DeQueue(SqQueue &Q,QElemType &e) { //删除头元素(即出队操作)
if(Q.front == Q.rese) {
printf("队列为空,无法执行出队操作,程序退出!");
exit(!0);
}
e = Q.base[Q.front];
Q.front = (Q.front + 1 ) % MAXQSIZE;
printf("\n\n出队元素为:%d\n",e);
}
void Printf(SqQueue &Q,QElemType &num) {
SqQueue elem = Q;
QElemType e,i = 0;
printf("队列内元素:");
while(elem.front != elem.rese) {
e = elem.base[elem.front];
printf("%4d",e);
elem.front = (elem.front + 1 ) % MAXQSIZE;
i++;
}
printf("\n队列已用长度为:%d",i);
}
int main() {
SqQueue Q;
QElemType e,num;
InitQueu(Q,num); //构造队列
Printf(Q,num); //输出队列
DeQueue(Q,e); //删除头元素
Printf(Q,num); //输出队列
EnQueue(Q,e); //插入元素
Printf(Q,num); //输出队列
QueueLength(Q); //获取队列剩余长度
return 0;
}
C语言—循环队列
猜你喜欢
转载自blog.csdn.net/Long_UP/article/details/121767082
今日推荐
周排行