数据结构实验之链表四:有序链表的归并
Time Limit: 1000 ms Memory Limit: 65536 KiB
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 100Sample Output
1 14 21 23 26 28 45 50 66 99 100Hint
不得使用数组!
Source
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
}*head1, *head2, *head3;
struct node *creat(int n)
{
int i;
struct node *t, *p, *head;
head = (struct node*)malloc(sizeof(struct node));
head -> next =NULL; t = head;
for(i = 0; i < n; i++)
{
p = (struct node*)malloc(sizeof(struct node));
scanf("%d", &p->data);p->next = NULL;
t ->next = p;t = p;
}
return head;
};
void show(struct node *head)
{
head=head->next;
while(head)
{
if(head->next!=NULL)
printf("%d ",head->data);
else
printf("%d\n",head->data);
head=head->next;
}
}
struct node *hebing(struct node*head,struct node *h1,struct node *h2)
{
struct node *p1,*p2,*tail;
tail=head;
p1=h1->next;
p2=h2->next;
while(p1&&p2)
{
if(p1->data<p2->data)
{
tail->next=p1;
tail=p1;
p1=p1->next;
}
else
{
tail->next=p2;
tail=p2;
p2=p2->next;
}
}
if(p1)
tail->next=p1;
else
tail->next=p2;
return head;
}
int main()
{
head3 = (struct node*)malloc(sizeof(struct node));
int n, m;scanf("%d %d", &n, &m);
head1 = creat(n);head2 = creat(m);
head3=hebing(head3,head2,head1);
show(head3);
return 0;
}