将随机数按整除3的余数存入三个链式队列

#include#include#include#include#define MAXSIZE 100#define TRUE 1 #define FALSE 0#define OK 1#define OVERFLOW 0typedef int ElemType;typedef int Status;typedef struct nodeElemType data; struct node *next;QNode; typedef struct QNode *front,*rear;LQueue; void InitQueue(LQueue *lq)/初始化队列/lq-front =lq-rear=(QNode*)malloc(sizeof(QNode); lq-front-next = NULL; return ;Status EmptyQueue(LQueue *lq)/判断是否为空队列/return(lq-front=NULL&lq-rear=NULL);void In_Queue(LQueue *lq,ElemType e)/从队尾插入元素/QNode *p=(QNode *)malloc(sizeof(QNode);p-data=e;p-next=NULL;if(EmptyQueue(lq)lq-front=lq-rear=p;elselq-rear-next=p;lq-rear=p;Status Out_Queue(LQueue *lq,ElemType &e)/从队头删除元素/QNode *p;if(EmptyQueue(lq)printf(队列为空无法删除！n);return OVERFLOW;else p=lq-front;e=p-data;lq-front=p-next;if(lq-rear=p)lq-rear=NULL;free(p);return OK;void Print(LQueue *lq) /打印队列的元素 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); void main()int ch;LQueue lq1,lq2,lq3;int a; InitQueue(&lq1); InitQueue(&lq2);InitQueue(&lq3);srand( (unsigned)time( NULL ) ); for(int i=0;i20;i+) a=rand()%100+1; printf(%dn,a);if(a%3=0)In_Queue(&lq1,a);else if(a%3=1)In_Queue(&lq2,a);elseIn_Queue(&lq3,a);printf(第一个队列为：n);Prin