实现队列的存储结构,入队,出队,求队长操作
内容很简单,直接上代码:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define MAXSIZE 10
typedef int QElemType;
typedef struct {
QElemType *base;
int flont;
int rear;
}SqQueue;
void InitQueue(SqQueue &Q){
Q.base = (QElemType*)malloc(MAXSIZE*sizeof(QElemType));
if(!Q.base) {
printf("队列初始化失败!\n");
return;
}
Q.flont = 0;
Q.rear = 0;
printf("队列初始化完成!\n");
}
void EnQueue(SqQueue &Q, QElemType e){
if(Q.flont==(Q.rear+1)%MAXSIZE) {
printf("队列为满!\n");
return;
}
Q.base[Q.rear] = e;
Q.rear = (Q.rear+1)%MAXSIZE;
printf("入队操作成功\n");
}
void DeQueue(SqQueue &Q, QElemType &e){
//出队操作,e保存出队元素
if(Q.flont==Q.rear) {
printf("队空,出队失败!\n");
return;
}
e = Q.base[Q.flont];
Q.flont = (Q.flont+1)%MAXSIZE;
printf("出队元素为:%d\n",e);
}
int Length_Queue(SqQueue &Q){
return (Q.rear-Q.flont+MAXSIZE)%MAXSIZE;
}
int main(){
SqQueue Q;
InitQueue(Q);
int c,e;
printf("1 入队,2 出队,3 求队列长度,按其他结束\n");
while(1){
printf("选择将要进行的操作:\n");
scanf("%d",&c);
if(c==1){
printf("请输入入对的元素:\n");
scanf("%d",&e);
EnQueue( Q , e );
}
else if(c==2){
DeQueue( Q , e );
}
else if(c==3){
printf("队列长度为:%d\n", Length_Queue(Q));
}
else break;
}
}
运行: