发布时间 : 星期三 文章厦门理工学院数据结构课程设计更新完毕开始阅读79d0671fcf84b9d529ea7a18
void findStartTime(plane *head) { plane *p; char starttime[10]; printf(\请输入查找航班的起飞时间:\ scanf(\ p=head; printf(\航班号 起点站 终点站 起飞时间 到达时间 票价 机型\\n\ while (p!=NULL) { if(strcmp(starttime,p->starttime)==0) { printf(\ %-10s %-10s%s\\n\rttime,p->arrivingtime,p->price,p->model); break; } else p=p->next; } if(p==NULL) printf(\查无此航班！\\n\}
/*按到达时间查找*/
void findArrivingTime(plane *head) { plane *p; char arrivingtime[10]; printf(\请输入查找航班的到达时间:\ scanf(\ p=head; printf(\航班号 起点站 终点站 起飞时间 到达时间 票价 机型\\n\ while (p!=NULL) { if(strcmp(arrivingtime,p->arrivingtime)==0) { printf(\ %-10s %-10s%s\\n\rttime,p->arrivingtime,p->price,p->model); break; }
16
else p=p->next; } if(p==NULL) printf(\查无此航班！\\n\}
/*按票价查找*/
void findPrice(plane *head) { plane *p; char price[10]; printf(\请输入查找航班的票价:\ scanf(\ p=head; printf(\航班号 起点站 终点站 起飞时间 到达时间 票价 机型\\n\ while (p!=NULL) { if(strcmp(price,p->arrivingtime)==0) { printf(\ %-10s %-10s%s\\n\rttime,p->arrivingtime,p->price,p->model); break; } else p=p->next; } if(p==NULL) printf(\查无此航班！\\n\}
/*按机型查找*/
void findModel(plane *head) { plane *p; char model[10]; printf(\请输入查找航班的机型:\ scanf(\ p=head; printf(\航班号 起点站 终点站 起飞时间 到达时间 票价 机型\\n\ while (p!=NULL)
17
{ if(strcmp(model,p->arrivingtime)==0) { printf(\ %-10s %-10s%s\\n\rttime,p->arrivingtime,p->price,p->model); break; } else p=p->next; } if(p==NULL) printf(\查无此航班！\\n\}
/*按航班号排序*/
plane *sortNumber(plane *head) { char *temp; plane *p,*head1,*s,*t,*l,*m; head1=(plane *)malloc(sizeof(plane)); head1=NULL; temp=(char *)malloc(sizeof(char)); if(head==NULL) { printf(\目前无航班！\\n\ return head; } while(head!=NULL) { s=head1; l=head; p=head->next; strcpy(temp,head->number); while(p!=NULL) { if(strcmp(temp,p->number)<0) { strcpy(temp,p->number); } p=p->next; } while(strcmp(temp,l->number)!=0) {
18
m=l; l=l->next; } t=(plane *)malloc(sizeof(plane)); strcpy(t->number,l->number); strcpy(t->start,l->start); strcpy(t->arrive,l->arrive); strcpy(t->starttime,l->starttime); strcpy(t->arrivingtime,l->arrivingtime); strcpy(t->price,l->price); strcpy(t->model,l->model); head1=t; t->next=s; if(l==head) head=head->next; else if(l->next==NULL) m->next=NULL; else m->next=l->next; } printf(\排序成功！\\n\ return head1; }
/*按起点站排序*/
plane *sortStart(plane *head) { char *temp; plane *p,*head1,*s,*t,*l,*m; head1=(plane *)malloc(sizeof(plane)); head1=NULL; temp=(char *)malloc(sizeof(char)); if(head==NULL) { printf(\目前无航班！\\n\ return head; } while(head!=NULL) { s=head1; l=head; p=head->next; strcpy(temp,head->start); while(p!=NULL)
19