患者到医院看病事件模拟

来源：互联网发布：深入分析java web 编辑：程序博客网时间：2024/04/27 18:35

本以为会很难，结果却发现……

嗯，还是别说了吧，这里有小秘密，自己领会去吧~！

代码：

#include <stdio.h>#include <string.h>#include <stdlib.h>#define MAXQSIZE 10000typedef struct{ int *base; int front; int rear;} SqQueue;void InitQueue(SqQueue &Q){ Q.base = (int*)malloc(MAXQSIZE*sizeof(int)); if(!Q.base) { puts("内存分配失败."); exit(0); } Q.front = Q.rear = 0;}void EnQueue(SqQueue &Q,int Number){ if((Q.rear + 1)%MAXQSIZE == Q.front) { puts("栈满."); } Q.base[Q.rear] = Number; Q.rear = (Q.rear + 1)%MAXQSIZE;}void DeQueue(SqQueue &Q,int &Number){ Number = Q.base[Q.front]; Q.front = (Q.front + 1)%MAXQSIZE;}int main(void){ SqQueue Q; InitQueue(Q); char ch; int Number; while(1) { scanf("%c",&ch); getchar(); if(ch == 'A' || ch == 'a') { scanf("%d/n",&Number); EnQueue(Q,Number); } else if(ch == 'N' || ch == 'n') { if(Q.rear == Q.front) { puts("无病人就诊"); } else { DeQueue(Q,Number); printf("病历号为%d的病人就诊/n",Number); } } else if(ch == 'S' || ch == 's') { printf("今天不接受病人排队，下列排队的病人依次就诊:"); while(Q.front != Q.rear) { printf("%d ",Q.base[Q.front]); Q.front = (Q.front + 1)%MAXQSIZE; } puts(""); break; } else { puts("输入命令不合法！"); } } return 0;}