急！！！求高手给个指点关于链表的问题？？？？不甚感激
建立a b两个链表，链表中节点包括学号，成绩。要求把两个链表合并，按学号升序排列
程序代码：#include<stdio.h>
#include<malloc.h>
//#define NULL 0 有的软件函数库里面已定义
#define LEN sizeof(struct student)
struct student
{
long num;
int score;
struct student *next;
};
struct student listA,listB;
int n,sum=0;
struct student *creat(void) //链表建立函数
{
struct student *p1,*p2,*head;
n=0;
p1=p2=(struct student *)malloc(LEN);
printf("\nInput the number & score of student;\n");
printf("if number is 0,stop inputing!\n");
scanf("%ld,%d",&p1->num,&p1->score);
head=NULL;
while(p1->num!=0)
{
n=n+1;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%ld,%d",&p1->num,&p1->score);
}
p2->next=p1;
return (head);
}
struct student *insert(struct student *ah,struct student *bh) //链表合并函数
{
struct student *pa1,*pa2,*pb1,*pb2;
pa1=pa2=ah;
pb1=pb2=bh;
do
{
while((pb1->num>pa1->num)&&(pa1->next!=NULL))
{
pa2=pa1;
pa1=pa1->next;
}
if(pb1->num<=pa1->num)
{
if(ah=pa1)
ah=pb1;
else
pa2->next=pb1;
pb1=pb1->next;
pb2->next=pa1;
pa2=pb2;
pb2=pb1;
}
}
while((pa1->next!=NULL)||(pa1==NULL&&pb1!=NULL));
if((pb1->num>pa1->num)&&(pa1->next==NULL))
pa1->next=pb1;
return(ah);
}
void print(struct student *head) //链表输出函数
{
struct student *p;
printf("\n there are %d record:\n");
p=head;
if(p!=NULL)
do
{
printf("%ld%d",p->num,p->score);
p=p->next;
}
while(p!=NULL);
}
main()
{
struct student *creat(void);
struct student *insert(struct student *,struct student * );
void print(struct student *);
struct student *ahead,*bhead,*abh;
printf("\n input the lista:\n");
ahead=creat();
sum=sum+n;
printf("\n input the listb:\n");
bhead=creat();
sum=sum+n;
abh=insert(ahead,bhead);
print(abh);
}我输入如下的数据
结果没有得出我要的答案！
还请各位指点，不甚感激！！
