设有a,b两个链表，每个链表中的节点包括学号·成绩。要求将两个链表合并为一个链表，按学号升序排列
struct student *insert(struct student *ah,struct student *bh)  
{struct student  *pa1 , *pa2,*pb1,*pb2;  
 pa2=pa1=ah;  
 pb2=pb1=bh;  
 do   
 {while((pb1->num>pa1->num)&&(pa1->next!=NULL))  
{pa2=pa1;  
pa1=pa1->next;  
}  
if(pb->num<=pa1->num)&nbsp;&nbsp;
{if(ah=pa1)&nbsp;&nbsp;
&nbsp;ah=pb1;&nbsp;&nbsp;
&nbsp;else&nbsp;pa2->next=pb1;&nbsp;&nbsp;
&nbsp;pb1=pb1->next;&nbsp;&nbsp;
&nbsp;pb2->next=pa1;&nbsp;&nbsp;
pa2=pb2;&nbsp;&nbsp;
pb2=pb1;&nbsp;&nbsp;
}&nbsp;&nbsp;
}&nbsp;&nbsp;

谁给我讲讲思路 万分感谢

先问一句，你是用什么编译器的~~~

C语言没有&nbsp这样东东的，这个……我在HTML上见过~

struct student *insert(struct student *ah,struct student *bh)
{struct student *pa1,*pa2,*pb1,*pb2;
pa2=pa1=ah;
pb2=pb1=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&&pb1!=NULL));
if(pb1!=NULL)
pa1->next=pb1;
return(ah);
}     额  不好意思  弄错了  是这个

提供的代码不完整，只好写个示例参考：

#include <stdio.h>
#include <stdlib.h>

struct student
{
    int num;
    int score;
    struct student *next;
};

struct student *insert_sort(struct student *h, struct student *h2)
{
    struct student *p, *q, *s;
    p = h;
    q = NULL;
    s = (struct student *)malloc(sizeof(struct student));
    s->num = h2->num;
    s->score = h2->score;
    s->next = NULL;
    while (p)
    {
        if (h2->num <= p->num)
        {
            s->next = p;
            break;
        }
        q = p;
        p = p->next;
    }
    if (q)
        q->next = s;
    else
        h = s;
    return h;
}

void _list(struct student *h)
{
    struct student *p=h;
    while (p)
    {
        printf("%d\n", p->num);
        printf("%d\n\n", p->score);
        p = p->next;
    }
}

void _free(struct student *h)
{
    struct student *p=h, *q;
    while (p)
    {
        q = p->next;
        free(p);
        p = q;
    }
}

void _test()
{
    struct student ah[3]={{311,90,&ah[1]},{111,99,&ah[2]},{212,95,NULL}};
    struct student bh[3]={{321,80,&bh[1]},{121,89,&bh[2]},{222,85,NULL}};
    struct student *h, *p;
    p = ah;
    h = insert_sort(NULL, p);
    for (p=p->next; p!=NULL; p=p->next)
        h = insert_sort(h, p);
    for (p=bh; p!=NULL; p=p->next)
        h = insert_sort(h, p);
    _list(h);
    _free(h);
}

main()
{
    _test();
}