l[i].leftticket-=num;
int x=num;
cout< for(int j=1;j<=M;j++) { if(l[i].seat[j]==0) { l[i].seat[j]=1; cout< } else continue; break; } x--; } cout< 13 cout< } void denghoudingpiao(hangxian l[],int i) { pointer p; p=(pointer)malloc(sizeof(struct weidingpiaokehu)); cout< cout< p->next=null;//---------------插入队列 l[i].wd.rear->next=p; l[i].wd.rear=p; cout< } void dingpiaogongneng(hangxian l[],int n) { char c[M]; 14 int num; int m,p; do { cout< cin>>c; int i=1; while(i<=n) { if(!strcmp(c,l[i].zhongdianzhan)) { { cout< cout<<\终点站:\\航班 号:\ \飞机号:\ \ <<\飞行日期:\ \余票额: \ do { cout<<\请输入订票数额\ cin>>num; cout< 15 if(num<=l[i].leftticket) { dingpiao(l,i,num);//---------------------------------------转入订票; return; } else { cout<<\对不起,余票额不足!\ cout<<\是否还需订票\ cout<<\是请按1,等候订票请按2,退出请按0\ cin>>p; } }while(p==1); if(p==2) denghoudingpiao(l,i);//---------------------------------------------------插入等候队列; else break; } } 16 return;
相关推荐: