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

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

Output 

1 14 21 23 26 28 45 50 66 99 100

Hint

不得使用数组！

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
    int data;
    struct node * next;
}node;
node *create(node *&head, int n)
{
    node *p, *tail;
    int i;
    head = (node *)malloc(sizeof(node));
    head -> next = NULL;
    tail = head;
    for(int i = 0; i < n; i++)
    {
        p = (node *)malloc(sizeof(node));
        scanf("%d", &p -> data);
        p -> next = NULL;
        tail -> next = p;
        tail = p;
    }
    return head;
}
node *mergelist(node *&l, node *l1, node *l2)
{
    node *p = l1 -> next;
    node *q = l2 -> next;
    node *tail;
    l = l1;
    l -> next = NULL;
    tail = l;
    free(l2);
    while(p != NULL && q != NULL)
    {
        if(p -> data <= q -> data)
        {
            tail -> next = p;
            tail = p;
            p = p -> next;
        }
        else
        {
            tail -> next = q;
            tail = q;
            q = q -> next;
        }
    }
    if(p != NULL)
    {
        tail -> next = p;
    }
    if(q != NULL)
    {
        tail -> next = q;
    }
    return l;
}
void print(node *head)
{
    node *p = head -> next;
    while(p != NULL)
    {
        if(p -> next == NULL)printf("%d\n", p -> data);
        else printf("%d ", p -> data);
        p = p -> next;
    }
}
int main()
{
    int m, n;
    scanf("%d %d", &m, &n);
   node *l1 = create(l1, m);
   node *l2 = create(l2, n);
   node *l = mergelist(l, l1, l2);
   print(l);
    return 0;
}