数据结构实验之链表四：有序链表的归并

Problem Description

分别输入两个有序的整数序列（分别包含M和N个数据），建立两个有序的单链表，将这两个有序单链表合并成为一个大的有序单链表，并依次输出合并后的单链表数据。

Input

第一行输入M与N的值； 
第二行依次输入M个有序的整数；
第三行依次输入N个有序的整数。

Output

输出合并后的单链表所包含的M+N个有序的整数。

Example Input

6 5
1 23 26 45 66 99
14 21 28 50 100

Example Output

1 14 21 23 26 28 45 50 66 99 100

Hint

不得使用数组！

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define ERROR -1
#define OVERFLOW -2
#define OK 1

typedef int Elemtype;
typedef int Statu;
typedef struct Lnode
{
    Elemtype data;
    struct Lnode *next;
} Link;

Link * Creat(int n);
Link * Negative(Link *head);
Statu Dis_Link(Link *head);
Statu Merger(Link *head1, Link *head2);

int main()
{
    int n, m;
    Link *head1, *head2;
    scanf("%d%d", &n, &m);
    head1 = Creat(n);
    head2 = Creat(m);
    Merger(head1,head2);
    return 0;
}
Link *Creat(int n)
{
    Link *head, *p, *q;
    head = (Link *)malloc(sizeof(Link));
    head -> next = NULL;
    q = head;
    while(n--)
    {
        p = (Link *)malloc(sizeof(Link));
        p -> next = NULL;
        scanf("%d", &p -> data);
        q -> next = p;
        q = p;
    }
    return head;
}
Link * Negative(Link *head)
{
    Link *q, *p;
    p = head -> next;
    head -> next = NULL;
    q = p -> next;
    while(p)
    {
        p -> next = head -> next;
        head -> next = p;
        p = q;
        if(q)
        {
            q = q -> next;
        }
    }
    return head;
}
Statu Dis_Link(Link *head)
{
    Link *p;
    p = head -> next;
    while(p -> next)
    {
        printf("%d ", p -> data);
        p = p -> next;
    }
    printf("%d\n", p -> data);
    return OK;
}
Statu Merger(Link *head1, Link *head2)
{
    Link *p, *q, *r;
    p = head1 -> next;
    q = head2 -> next;
    r = head1;
    while(p && q)
    {
        if(p -> data < q -> data)
        {
            r -> next = p;
            r = p;
            p = p -> next;
        }
        else
        {
            r -> next = q;
            r = q;
            q = q -> next;
        }
    }
    if(p)
    {
        r -> next = p;
    }
    else
        r -> next = q;
    Dis_Link(head1);
   return OK;
}