数据结构实验之链表四：有序链表的归并

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 struct node
 4 {
 5     int data;
 6     struct node *next;
 7 };
 8 struct node *Creat(int n)
 9 {
10     struct node *head, *tail, *p;
11     int i;
12     head=(struct node *)malloc(sizeof(struct node));
13     head->next=NULL;
14     tail=head;
15     for(i=1;i<=n;i++)
16     {
17         p=(struct node *)malloc(sizeof(struct node));
18         scanf("%d",&p->data);
19         p->next=NULL;
20         tail->next=p;
21         tail=p;
22     }
23     return head;
24 }
25 
26 struct node * Merge(struct node *head1, struct node *head2)
27 {
28     struct node *p1, *p2, *tail;
29     p1=head1->next;
30     p2=head2->next;
31     tail=head1;
32     free(head2);
33     while(p1&&p2)
34     {
35     if(p1->data < p2->data)
36         {
37             tail->next=p1;
38             tail=p1;
39             p1=p1->next;
40         }
41         else
42         {
43             tail->next=p2;
44             tail=p2;
45             p2=p2->next;
46         }
47     }
48     if(p1)
49         tail->next=p1;
50     else
51         tail->next=p2;
52     return(head1);
53 }
54 
55 int main()
56 {
57     struct node * head1, *head2, *p;
58     int n, m;
59     scanf("%d %d",&n,&m);
60     head1=Creat(n);
61     head2=Creat(m);
62     p=Merge(head1,head2);
63     while(p->next->next!=NULL)
64     {
65         printf("%d ",p->next->data);
66         p=p->next;
67     }
68     printf("%d\n",p->next->data);
69     return 0;
70 }