本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下:
struct student
{
int data;
struct student *next;
};
函数接口定义:
struct student *merge(struct student *,struct student *);
其中list1和list2是用户传入的两个按data升序链接的链表的头指针;函数merge将两个链表合并成一个按data升序链接的链表,并返回结果链表的头指针。
裁判测试程序样例:
#include <stdio.h>
#include <malloc.h>
#define LEN sizeof(struct student)
struct student
{
int data;
struct student *next;
};
int main()
{
struct student *creat();
struct student *merge(struct student *,struct student *);
void print(struct student *);
struct student *ahead,*bhead,*abh;
ahead=creat();
bhead=creat();
abh=merge(ahead,bhead);
print(abh);
return 0;
}
struct student *creat() //建立链表函数
{struct student *p1,*p2,*head;
int n=0;
p1=p2=(struct student *)malloc(LEN);
scanf("%d",&p1->data);
head=NULL;
while(p1->data!=-1)
{n=n+1;
if (n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d",&p1->data);
}
p2->next=NULL;
return(head);
}
void print(struct student *head) //输出函数
{struct student *p;
p=head;
while (p !=NULL)
{printf("%d ",p->data);
p=p->next;
}
printf("\n");
}
/* 你的代码将被嵌在这里 */
输入样例:
在这里给出一组输入。例如:
2 6 9 -1
1 5 10 -1
输出样例:
在这里给出相应的输出。例如:
1 2 5 6 9 10
struct student *merge(struct student *ahead,struct student *bhead)
{
struct student *m,*p,*o;
m=ahead;
o=ahead;
int a;
while(ahead!=NULL)
{
p=ahead;
ahead=ahead->next;
}
p->next=bhead;
p=m;
for(m=o;m!=NULL;m=m->next)
{
for(p=o;p!=NULL;p=p->next)
{
if(m->data<p->data)
{
a=m->data;
m->data=p->data;
p->data=a;
}
}
}
return o;
}