將隨機(jī)數(shù)按整除3的余數(shù)存入三個(gè)鏈?zhǔn)疥?duì)列

將隨機(jī)數(shù)按整除3的余數(shù)存入三個(gè)鏈?zhǔn)疥?duì)列將隨機(jī)數(shù)按整除3的余數(shù)存入三個(gè)鏈?zhǔn)疥?duì)列/NUMPAGES7將隨機(jī)數(shù)按整除3的余數(shù)存入三個(gè)鏈?zhǔn)疥?duì)列將隨機(jī)數(shù)按整除3的余數(shù)存入三個(gè)鏈?zhǔn)疥?duì)列#include<stdio.h>#include<stdlib.h>#include<malloc.h>#include<time.h>#defineMAXSIZE100#defineTRUE1#defineFALSE0#defineOK1#defineOVERFLOW0typedefintElemType;typedefintStatus;typedefstructnode{ ElemTypedata; structnode*next;}QNode;typedefstruct{ QNode*front,*rear;}LQueue;voidInitQueue(LQueue*lq)//初始化隊(duì)列//{ lq->front=lq->rear=(QNode*)malloc(sizeof(QNode)); lq->front->next=NULL; return;}StatusEmptyQueue(LQueue*lq)//判斷是否為空隊(duì)列//{ return(lq->front==NULL&&lq->rear==NULL);}voidIn_Queue(LQueue*lq,ElemTypee)//從隊(duì)尾插入元素//{ QNode*p=(QNode*)malloc(sizeof(QNode)); p->data=e; p->next=NULL; if(EmptyQueue(lq)) lq->front=lq->rear=p; else { lq->rear->next=p; lq->rear=p; }}StatusOut_Queue(LQueue*lq,ElemType&e)//從隊(duì)頭刪除元素//{ QNode*p; if(EmptyQueue(lq)) { printf("隊(duì)列為空無(wú)法刪除！\n"); returnOVERFLOW; } else { p=lq->front; e=p->data; lq->front=p->next; if(lq->rear==p) lq->rear=NULL; free(p); returnOK; }}voidPrint(LQueue*lq)//打印隊(duì)列的元素{if(lq->front==lq->rear)return;QNode*temp=lq->front->next;while(temp!=lq->rear){printf("%d",temp->data);temp=temp->next;}printf("%d",temp->data);printf("\n");}voidmain(){ intch; LQueuelq1,lq2,lq3; inta;InitQueue(&lq1);InitQueue(&lq2); InitQueue(&lq3); srand((unsigned)time(NULL)); for(inti=0;i<20;i++) { a=rand()%100+1;printf("%d\n",a); if(a%3==0) In_Queue(&lq1,a); elseif(a%3==1) In_Queue(&lq2,a); else In_Queue(&lq3,a); } printf("第一個(gè)隊(duì)列為：\n