c 语言银行排队系统,C++实现银行排队系统
#include
#include
#include
int cnt=0; //當(dāng)日客流量
int sum=0; //當(dāng)日客戶排隊(duì)總時(shí)間
typedef struct pnode{
int number;
int cometime;
int leavetime;
struct pnode *next;
}*person;
typedef struct node{
person front;
person rear;
int length;
}linkqueue;
linkqueue q[5];
int number,time;
int flag=1;
void initqueue(linkqueue &q){
q.front=q.rear=(person)malloc(sizeof(pnode));
if(!q.front||!q.rear)
exit(0);
q.front->next=NULL;
q.length=0;
}
void enterqueue(linkqueue &q,int number,int time){
person p;
p=(person)malloc(sizeof(person));
if(!p) exit(0);
q.length++;
p->number=number;
p->cometime=time;
// sum+=p->finishtime; //統(tǒng)計(jì)每個(gè)人的排隊(duì)時(shí)長(zhǎng)
p->next=NULL;
q.rear->next=p;
q.rear=p;
}
void popqueue(linkqueue &q){
person p;
if(q.front==q.rear){
return ;
}
p=q.front->next;
q.front->next=p->next;
q.length--;
if(q.rear==p){
q.front=q.rear;
}
}
int getmin(linkqueue q[]){
int temp=q[1].length;
int j=1;
for(int i=2;i<=4;i++){
if(q[i].length
temp=q[i].length;
j=i;
}
}
return j;
}
int getmax(linkqueue q[]){
int temp=q[1].length;
int j=1;
for(int i=2;i<=4;i++){
if(q[i].length>temp){
temp=q[i].length;
j=i;
}
}
return j;
}
void Customer_Come(){
printf("客戶選隊(duì)并排隊(duì)\n\n");
printf("輸入客戶編號(hào):");
scanf("%d",&number);
printf("輸入當(dāng)前時(shí)間:");
scanf("%d",&time);
printf("\n");
/*
if(one.length<=two.length&&one.length<=three.length&&one.length<=four.length){
enterqueue(one,number,time);
}
else if(two.length<=one.length&&two.length<=three.length&&two.length<=four.length){
enterqueue(two,number,time);
}
else if(three.length<=one.length&&three.length<=two.length&&three.length<=four.length){
enterqueue(three,number,time);
}
else{
enterqueue(four,number,time);
}*/
printf("%d號(hào)顧客來(lái)到%d號(hào)窗口\n",number,getmin(q));
enterqueue(q[getmin(q)],number,time);
}
void Customer_Leave(){
printf("客戶離隊(duì):\n\n");
printf("輸入要離隊(duì)的客戶編號(hào): ");
scanf("%d",&number);
printf("輸入當(dāng)前時(shí)間: ");
scanf("%d",&time);
//從四個(gè)隊(duì)的隊(duì)首分別去找，因?yàn)殡x隊(duì)的只能是隊(duì)首。
/* if(one.front->next->number==number){
printf("%d號(hào)客戶辦理完成業(yè)務(wù)從1號(hào)窗口離開\n",number);
popqueue(one);
break;
}
if(two.front->next->number==number){
printf("%d號(hào)客戶辦理完成業(yè)務(wù)從2號(hào)窗口離開\n",number);
popqueue(two);
break;
}
if(three.front->next->number==number){
printf("%d號(hào)客戶辦理完成業(yè)務(wù)從3號(hào)窗口離開\n",number);
popqueue(three);
break;
}
if (four.front->next->number==number){
printf("%d號(hào)客戶辦理完成業(yè)務(wù)從4號(hào)窗口離開\n",number);
popqueue(four);
break;
} */
for(int i=1;i<=4;i++){
if(q[i].front->next->number==number){
sum+=time-q[i].front->next->cometime;
printf("%d號(hào)客戶辦理完成業(yè)務(wù)從%d號(hào)窗口離開\n",number,i);
popqueue(q[i]);
flag=0;
}
}
if(flag)
printf("編號(hào)錯(cuò)誤請(qǐng)重新輸入\n");
}
void Adjust_Queue(linkqueue q[]){
int m=getmin(q);
int n=getmax(q);
person x,y;
x=(person)malloc(sizeof(pnode));
y=(person)malloc(sizeof(pnode));
x=q[n].rear;
enterqueue(q[m],x->number,x->cometime);
y=q[n].front;
while(y->next!=q[n].rear)
y->next=y->next->next;
q[n].rear=y;
free(y->next);
q[n].length--;
q[m].length++;
}
void Close_Door(){
printf("下班時(shí)間到，工作結(jié)束。\n");
printf("今天共接待了%d位客戶\n", cnt);
printf("每位客戶平均逗留時(shí)間為%.2f\n", (float)sum/cnt);
}
void welcome(){
printf(" ************************** *************************\n");
printf(" * 模擬銀行排隊(duì)系統(tǒng) * * 請(qǐng)輸入號(hào)碼選擇功能 *\n");
printf(" ************************** *************************\n");
printf(" 當(dāng)前一號(hào)隊(duì)列人數(shù)：%3d \n",q[1].length);
printf(" 1 客戶選隊(duì)并排隊(duì) \n");
printf(" 當(dāng)前二號(hào)隊(duì)列人數(shù)：%3d \n",q[2].length);
printf(" 2 客戶離隊(duì) \n");
printf(" 當(dāng)前三號(hào)隊(duì)列人數(shù)：%3d \n",q[3].length);
printf(" 3 退出系統(tǒng) \n");
printf(" 當(dāng)前四號(hào)隊(duì)列人數(shù)：%3d \n",q[4].length);
printf(" ************************** *************************\n");
}
int main(){
//initqueue(one);
//initqueue(two);
//initqueue(three);
//initqueue(four);
for(int i=1;i<=4;i++){
initqueue(q[i]);
}
while(1){
welcome();
int x;
scanf("%d",&x);
switch(x){
case 1:
cnt++;
Customer_Come();
break;
case 2:
Customer_Leave();
while(q[getmax(q)].length-q[getmin(q)].length>=2)
Adjust_Queue(q);
break;
case 3:
Close_Door();
exit(0);
break;
}
}
return 0;
}
總結(jié)
以上是生活随笔為你收集整理的c 语言银行排队系统,C++实现银行排队系统的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。
- 上一篇： educoderpython答案顺序结构
- 下一篇： iphone版 天行skyline_Sk