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

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

Time Limit: 1000MS  Memory Limit: 65536KB

Submit  Statistic

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

#include <bits/stdc++.h>
using namespace std;

struct node
{
    int data;
    node *next;
};

int n, m;

struct node* creat(int n)
{
    node *head, *tail, *p;
    head = new node;
    head->next = NULL;
    tail = head;
    for(int i = 0; i < n; i++)
    {
        p = new node;
        cin >> p->data;
        p->next = NULL;
        tail->next = p;
        tail = p;
    }
    return (head);
}

struct node *Merge(node *head1, node *head2)
{
    struct node *p, *q, *tail;
    p = head1->next;
    q = head2->next;
    tail = head1;
    while(p&&q)
    {
        if(p->data < q->data)
        {
            tail->next = p;
            tail = p;
            p = p->next;
        }
        else
        {
            tail->next = q;
            tail = q;
            q = q->next;
        }
    }
    if(q)
    {
        tail->next = q;
    }
    else
        tail->next = p;
    return (head1);
}

void display(struct node *head)
{
    struct node *p;
    for(p = head->next; p; p=p->next)
    {
        if(p->next)
            cout << p->data << " ";
        else
            cout << p->data << endl;
    }
}

int main()
{
    struct node *head, *head1, *head2;
    cin >> n >> m;
    head1 = creat(n);
    head2 = creat(m);
    head = Merge(head1, head2);
    display(head);
    return 0;
}