链表合并（作代码记录用）

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

#include<string.h>

typedef struct student

{

    int num;

    int grade;

    struct student *next;

}node;

node *creatnode(int number);

//void sortnode(node *shape);

void sortNode(node *head);

int main()

{

    int n,m;

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

    node *firstlist=creatnode(n);

    node *secondlist=creatnode(m);

    for(node *add=firstlist;add!=NULL;add=add->next)

    {

        if(add->next==NULL)

        {

            add->next=secondlist->next;

            break;

        }

    }

    sortNode(firstlist);

    for(node *add1=firstlist->next;add1!=NULL;add1=add1->next)

    {

        printf("%d %d\n",add1->num,add1->grade);

    }

    return 0;

}

node *creatnode(int number)

{

    node *head,*normal,*temp;

    head=(node *)malloc(sizeof(node));

    if(head==NULL)

    {

        exit(0);

    }

    head->next=NULL;

    temp=head;

    for(int i=0;i<number;i++)

    {

        normal=(node *)malloc(sizeof(node));

        if(normal==NULL)

        {

            exit(0);

        }

        scanf("%d %d",&normal->num,&normal->grade);

        temp->next=normal;

        temp=normal;

    }

    temp->next=NULL;

    return head;

}

/*void sortnode(node *shape)

{

    node *he=shape;

    node *init=shape;

    init->num=-1;

    while(he!=NULL)

    {

        for(init=shape;init!=he;init=init->next)

        {

            if(init->num>he->num)

            {

                node *temp1;

                temp1->num=he->num;

                temp1->grade=he->grade;

                temp1->next=NULL;

                he->num=init->num;

                he->grade=init->grade;

                init->num=temp1->num;

                init->grade=temp1->grade;

                continue;

            }

        }

        he=he->next;

    }

}*/

void sortNode(node *head) {

    node *he = head->next;

    while (he != NULL) {

        node *init = he->next;

        while (init != NULL) {

            if (he->num > init->num) {

                int tempNum = he->num;

                int tempGrade = he->grade;

                he->num = init->num;

                he->grade = init->grade;

                init->num = tempNum;

                init->grade = tempGrade;

            }

            init = init->next;

        }

        he = he->next;

    }

}