#define MAXQSIZE 100
#define N 5
typedef struct{ int *base;
int front;
int rear; }Sqqueue;
Sqqueue initqueue(Sqqueue Q)/*队列初始化函数*/
{ Q.base=(int *)malloc(MAXQSIZE*sizeof(int));
if(!Q.base) printf("OVERFLOW\n");
else Q.front=Q.rear=0;
return Q;}
Sqqueue enqueue(Sqqueue Q,int x)/*队列插入函数*/
{ if ((Q.rear+1)%MAXQSIZE==Q.front)
printf("ERROR\n");
else{Q.base[Q.rear]=x;
Q.rear=(Q.rear+1)%MAXQSIZE;}
return Q;}
Sqqueue dequeue(Sqqueue Q)/*队列删除函数*/
{ int x;
if (Q.front==Q.rear)
printf("ERROR\n ");
else {x=Q.base[Q.front]; printf("\nthe delete data is:%d",x);
Q.front=(Q.front+1)%MAXQSIZE;}
return Q;}
void display(Sqqueue Q)/*队列元素输出函数*/
{int k,m;
k=Q.front;m=Q.rear;
while(k!=m)
{printf("%5d",Q.base[k]);
k=(k+1)%MAXQSIZE;}
printf("\n");}
main()/*主函数*/
{Sqqueue Q;
int i,x,y;
Q=initqueue(Q);/*调用队列初始化函数*/
printf("please input create data:\n");/*请求输入队列中各个元素*/
for(i=1;i<=N;i++)
{scanf("%d",&x);
Q=enqueue(Q,x);}/*调用队列插入函数*/
printf("\nthe queue is:\n");
display(Q);/*调用队列元素输出函数*/
printf("\nplease input a insert data:\n");/*请求输入需要插入的元素*/
scanf("%d",&y);
Q=enqueue(Q,y);/*调用队列插入函数*/
printf("\nthe queue after insert is:\n");/*显示执行插入操作后的队列*/
display(Q);/*调用队列元素输出函数*/
Q=dequeue(Q);/*调用队列删除函数*/
printf("\nthe queue after delete is:\n");/*显示执行删除操作后的队列*/
display(Q);/*调用队列元素输出函数*/
}
评论0