厦门理工学院数据结构课程设计

{ if(strcmp(temp,p->start)<0) { strcpy(temp,p->start); } p=p->next; } while(strcmp(temp,l->start)!=0) { 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 *sortArrive(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\

20

return head; } while(head!=NULL) { s=head1; l=head; p=head->next; strcpy(temp,head->arrive); while(p!=NULL) { if(strcmp(temp,p->arrive)<0) { strcpy(temp,p->arrive); } p=p->next; } while(strcmp(temp,l->arrive)!=0) { 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 *sortStartTime(plane *head)

21

{

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->starttime); while(p!=NULL) { if(strcmp(temp,p->starttime)<0) { strcpy(temp,p->starttime); } p=p->next; } while(strcmp(temp,l->starttime)!=0) { 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;

22

else m->next=l->next; } printf(\排序成功！\\n\ return head1; }

/*按终点时间排序*/

plane *sortArrivingTime(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->arrivingtime); while(p!=NULL) { if(strcmp(temp,p->arrivingtime)<0) { strcpy(temp,p->arrivingtime); } p=p->next; } while(strcmp(temp,l->arrivingtime)!=0) { 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);

23