for循环和while循环

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h> 

typedef struct Node{

int id;

int num;

struct Node *next;

}LinkList;

LinkList *Create(int c){

LinkList *head,*s,*r;

int num;

int id;

head=NULL;

r=NULL;

for(int i=0;i<c;i++){

scanf("%d %d",&id,&num);

s=(LinkList*)malloc(sizeof(LinkList));

s->id=id;

s->num=num;

s->next=NULL;

if(head==NULL){

head=s;

r=s;

}

else{

r->next=s;

r=s;

}

}

if(r->next!=NULL){

r->next=NULL;

}

return head;

}

LinkList* hebing(LinkList *pa,LinkList *pb){

if(pa==NULL){

return pb;

}

LinkList *r=pa;

while(r->next!=NULL){

r=r->next;

}

r->next=pb;

return pa; 

}

void exchange(LinkList *head){

for(LinkList *p=head;p!=NULL;p=p->next){

int cur_id=0;

int cur_num=0;

for(LinkList *q=p->next;q!=NULL;q=q->next){

if(p->id>q->id){

cur_id=p->id;

p->id=q->id;

q->id=cur_id;

cur_num=p->num;

p->num=q->num;

q->num=cur_num;

}

}

}

}

void destory(LinkList *head){

LinkList *p=head;

while(p!=NULL){

LinkList *temp=p->next;

free(p);

p=temp;

}

}

int main(){

int x;

int y;

scanf("%d %d",&x,&y);

LinkList *pa=Create(x);

LinkList *pb=Create(y);

LinkList *pc=hebing(pa,pb);

exchange(pc);

LinkList *fr=pc;

while(fr!=NULL){

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

fr=fr->next;

}

destory(pc);

return 0;

}