题解 1052: [编程入门]链表合并

参考代码:

#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
    int number;
    int grade;
    struct Node *next;
}Node,*LinkedList;
LinkedList LinkedListCreat(int x)
{
    Node *L;
    L=(Node *)malloc(sizeof(Node));
    L->next=NULL;
    Node *r;
    r=L;
    while(x--)
    {
        int n,g;
        scanf("%d%d",&n,&g);
        Node *p;
        p=(Node *)malloc(sizeof(Node));
        p->number=n;
        p->grade=g;
        r->next=p;
        r=p;
    }
    r->next=NULL;

    return L;
}
void print(LinkedList L)
{
    Node *p=L->next;
    while(p)
    {
        printf("%d %d\n",p->number,p->grade);
        p=p->next;
    }
}
void sort(LinkedList a,LinkedList b)
{
    LinkedList q;
    q    = a;
    b    = b->next;

    while ( q->next != NULL )
    {
        q = q->next;
    }
    q->next = b;

    q = a->next;

    int t;
    int n,g;
    LinkedList min;
    LinkedList p;
    while(q!=NULL)
    {
        p=q;
        t=p->number;
        min=p;
        while(p!=NULL)
        {
            if(p->number<t)
            {
                t=p->number;
                min=p;
            }
            p=p->next;
        }
        n=q->number;
        q->number=min->number;
        min->number=n;

        g=q->grade;
        q->grade=min->grade;
        min->grade=g;

        q=q->next;
    }
    print(a);
}
int main()
{
    LinkedList a,b;
    LinkedList c;
    int m,n;
    scanf("%d%d",&m,&n);
   a=LinkedListCreat(m);
   b=LinkedListCreat(n);
   sort(a,b);
        return 0;
}