数据结构实验之链表四:有序链表的归并
Problem Description
分别输入两个有序的整数序列(分别包含M和N个数据),建立两个有序的单链表,将这两个有序单链表合并成为一个大的有序单链表,并依次输出合并后的单链表数据。
Input
第一行输入M与N的值;
第二行依次输入M个有序的整数;
第三行依次输入N个有序的整数。
Output
输出合并后的单链表所包含的M+N个有序的整数。
Sample Input
6 5
1 23 26 45 66 99
14 21 28 50 100
Sample Output
1 14 21 23 26 28 45 50 66 99 100
Hint
不得使用数组!
Source
#include <stdio.h>
#include <stdlib.h>
struct node *head1 , *head2 , *head3;
struct node
{
int data;
struct node *next;
};
void creat_list1(int n)
{
head1 = (struct node *)malloc(sizeof (struct node));
struct node *p ,*q;
p = head1 ;
p ->next = NULL;
while(n--)
{
q = (struct node *)malloc(sizeof (struct node));
scanf("%d" , &q->data);
p ->next = q;
p = q;
p ->next = NULL;
}
}
void creat_list2(int m)
{
head2 = (struct node *)malloc(sizeof (struct node));
struct node *p ,*q;
p = head2 ;
p ->next = NULL;
while(m--)
{
q = (struct node *)malloc(sizeof (struct node));
scanf("%d" , &q->data);
p ->next = q;
p = q;
p ->next = NULL;
}
}
void mergelist(struct node *head1 , struct node *head2)
{
struct node *p , *q , *w;
p = head1 ->next;
q = head2 ->next;
head3 = w = head1;
while(p && q)
{
if (p ->data <= q ->data)
{
w ->next = p ;
w = p;
p = p ->next;
}
else
{
w ->next = q;
w = q;
q = q->next;
}
}
if (p)
{
w ->next = p;
}
else if (q)
{
w ->next = q;
}
}
void print()
{
struct node *p;
p = head1 ->next;
while(p)
{
if (p ->next == NULL)
printf("%d\n" , p->data );
else
printf("%d " , p->data);
p = p->next;
}
}
int main()
{
int n , m;
scanf("%d %d" , &n , &m);
creat_list1(n);
creat_list2(m);
mergelist(head1 , head2);
print();
return 0;
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)