c语言h next,[编程入门]链表合并-题解(C语言代码)

struct date

{

int id;

int num;

struct date *next;

};

typedef struct date NODE;

NODE *create(NODE *p,int hh)

{

NODE *head,*tail;

int i;

head=NULL;

for(i=0;inext=NULL;

scanf("%d%d",&p->id,&p->num);

if(head==NULL) head=p;

else tail->next=p;

tail=p;

}

return head;

}

void link(NODE *p1,NODE *p2)

{

while(1){

if(p1->next!=NULL)

{

p1=p1->next;

}

else {p1->next=p2;break;}

}

}

NODE *rank(NODE *p1)

{

NODE *p2=p1,*p3;

for(;p2!=NULL;p2=p2->next)

{

for(p3=p2->next;p3!=NULL;p3=p3->next)

{

if(p2->id>p3->id)

{

int temp;

temp = p2->id;p2->id= p3->id; p3->id= temp;

temp = p2->num; p2->num= p3->num; p3->num=temp;

}

}

}

return (p1);

}

void display(NODE *p)

{

while(p!=NULL)

{

printf("%d %d\n",p->id,p->num);

p=p->next;

}

}

int main()

{

NODE *p1,*p2;

int n,m;

scanf("%d%d",&n,&m);

p1=create(p1,n);

p2=create(p2,m);

link(p1,p2);

p1=rank(p1);

display(p1);

return 0;

}