数据结构有序表的归并..docVIP

有序表的归并 #includestdio.h #includestdlib.h typedef struct List { int date; struct List *next; }List; List *head1,*head2,*head3; int IsEmpty(List *p) { p=p-next; if(p==NULL) return 0; else return 1; //判断是否为空，是的话返回0; } int IsLast(List *p) { if(p==NULL) return 0; else return 1; //判断链表是否达到最后一个，是的话返回0 } List *Insert(List *head,int n) { List *p,*q; p=(List *)malloc(sizeof(List)); p-date=n; p-next=NULL; q=head; while(q-next!=NULL) q=q-next; q-next=p; return head; //传入一个date值，将这个值插入到一 head为头的链表中，返回head } List *MakeList(List *head,FILE *fp) { int length; fscanf(fp,%d,length); int dat; List *p=NULL; List *q=NULL; q=head; for(int i=0;ilength;i++) { p=(List *)malloc(sizeof(List)); fscanf(fp,%d,dat); p-date=dat; q-next=p; p-next=NULL; q=p; } return head; //创建以head为头，长度为length的链表 } void ShowList(List *head,FILE *fp) { int flag=1; List *p; p=head; while(flag) { fprintf(fp,%d ,p-date); p=p-next; flag=IsLast(p); } } int main() { // 以下是实验要求的实现 int flag1,flag2; List *p,*q; FILE *fp; fp=fopen(input.txt,r); head1=(List *)malloc(sizeof(List)); head2=(List *)malloc(sizeof(List)); head3=(List *)malloc(sizeof(List)); head1-date=0; head1-next=NULL; head2-date=0; head2-next=NULL; head3-date=0; head3-next=NULL; head1=MakeList(head1,fp); head2=MakeList(head2,fp); fclose(fp); fp=fopen(output.txt,w); p=head1-next; q=head2-next; flag1=IsLast(p); flag2=IsLast(q); while(flag1!=0 flag2!=0) { if(p-date q-date ) { head3=Insert(head3,p-date); p=p-next; flag1=IsLast(p); } else { head3=Insert(head3,q-date); q=q-next; flag2=IsLast(q); } } if(flag1!=0) { while(flag1) { head3=Insert(head3,p-date); p=p-next; flag1=IsLast(p); } } else { while(flag2) { head3=Insert(head3,q-date); q=q-next;