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

数据结构实验之链表四：有序链表的归并
Time Limit: 1000 ms Memory Limit: 65536 KiB
Submit Statistic
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
Hint
不得使用数组！

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
};
struct node* create(int n)
{
    struct node*head, *t;
    head = (struct node*)malloc(sizeof(struct node));
    head->next = NULL;
    t = head;
    while(n--)
    {
        struct node*p;
        p = (struct node*)malloc(sizeof(struct node));
        p->next = NULL;
        scanf("%d", &p->data);
        t->next = p;
        t = p;
    }
    return head;
}
struct node* f(struct node*head1, struct node*head2)
{
    struct node*p, *q, *t;
    p = head1->next;
    q = head2->next;
    head1->next = NULL;
    t = head1;
    while(p&&q)
    {
        if(p->data < q->data)
        {
            t->next = p;
            t = p;
            p = p->next;
        }
        else
        {
            t->next = q;
            t = q;
            q = q->next;
        }
    }
    while(p)
    {
        t->next = p;
        t = p;
        p = p->next;
    }
    while(q)
    {
        t->next = q;
        t = q;
        q = q->next;
    }
    return head1;
}
void show(struct node*head)
{
    struct node *p;
    p = head->next;
    while(p)
    {
        printf("%d%c", p->data, p->next==NULL? '\n': ' ');
        p = p->next;
    }
    return;
}
int main()
{
    int n, m;
    scanf("%d %d", &m, &n);
    struct node*head1, *head2;
    head1 = create(m);
    head2 = create(n);
    head1 = f(head1, head2);
    show(head1);
    return 0;
}


/***************************************************
User name: jk160532姜兴友
Result: Accepted
Take time: 0ms
Take Memory: 208KB
Submit time: 2017-10-08 13:59:42
****************************************************/