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

Problem Description
分别输入两个有序的整数序列（分别包含M和N个数据），建立两个有序的单链表，将这两个有序单链表合并成为一个大的有序单链表，并依次输出合并后的单链表数据。                
Input
第一行输入M与N的值；
第二行依次输入M个有序的整数；
第三行依次输入N个有序的整数。
Output
输出合并后的单链表所包含的M+N个有序的整数。
Sample Input
6 5
1 23 26 45 66 99
14 21 28 50 100
Sample Output
1 14 21 23 26 28 45 50 66 99 100

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node * next;
};
struct node * creat(int n)
{
    struct node * head, * p, * tail;
    int i;
    head = (struct node *)malloc(sizeof(struct node *));
    head -> next = NULL;
    tail = head;
    for(i = 1; i <= n; i++)
    {
        p = (struct node *)malloc(sizeof(struct node *));
        scanf("%d", &p -> data);
        p -> next = NULL;
        tail -> next = p;
        tail = p;
    }
    return head;
};
int main()
{
    struct node * h1, * h2, * p, * tail, * p1, * p2;
    int m, n;
    scanf("%d %d", &m, &n);
    h1 = creat(m);
    h2 = creat(n);
    p1 = h1 -> next;
    p2 = h2 -> next;
    h1 -> next = NULL;
    h2 -> next = NULL;
    tail = h1;
    free(h2);
    while(p1 && p2)
    {
        if(p1 -> data < p2 -> data)
        {
            tail -> next = p1;
            tail = p1;
            p1 = p1 -> next;
        }
        else
        {
            tail -> next = p2;
            tail = p2;
            p2 = p2 -> next;
        }
    }
    if(p1)
    {
        tail -> next = p1;
    }
    if(p2)
    {
        tail -> next = p2;
    }
    p = h1 -> next;
    printf("%d", p -> data);
    p = p -> next;
    while(p != NULL)
    {
        printf(" %d", p -> data);
        p = p -> next;
    }
    printf("\n");
    return 0;
}