两个有序链表序列的合并

7-1 两个有序链表序列的合并 （20 分）

已知两个非降序链表序列S1与S2，设计函数构造出S1与S2合并后的新的非降序链表S3。

输入格式:

输入分两行，分别在每行给出由若干个正整数构成的非降序序列，用−1表示序列的结尾（−1不属于这个序列）。数字用空格间隔。

输出格式:

在一行中输出合并后新的非降序链表，数字间用空格分开，结尾不能有多余空格；若新链表为空，输出NULL。

输入样例:

1 3 5 -1
2 4 6 8 10 -1

输出样例:

1 2 3 4 5 6 8 10

#include <bits/stdc++.h>
using namespace std;
list<int> l1,l2;
list<int> ::iterator it;
int main()
{
    int x;
    l1.clear();
    l2.clear();
    while(cin>>x&&x!=-1)
    {
        l1.push_back(x);
    }
    while(cin>>x&&x!=-1)
    {
        l2.push_back(x);
    }
    l1.merge(l2);
    if(l1.size()==0)
    {
        cout<<"NULL"<<endl;
        return 0;
    }
    for(it=l1.begin(); it!=l1.end(); it++)
    {
        if(it==l1.begin())
            cout<<*it;
        else
            cout<<' '<<*it;
    }
    cout<<endl;
    return 0;
}

 法2:

#include <cstdio>
#include <list>
using namespace std;
int main()
{
    list<int>  list1;
    list<int>  list2;
    list<int>::iterator it,it1,it2;
    int val=0;
    bool flag = false;
    while(scanf("%d",&val),val!=-1)
        list1.push_back(val);
    while(scanf("%d",&val),val!=-1)
        list2.push_back(val);
    if (list1.empty()&&list2.empty())
        printf("NULL\n");
    for (it1=list1.begin(),it2=list2.begin(); it1!=list1.end()&&it2!=list2.end();)
    {
        if (*it1 < *it2)
        {
            if (flag)
                printf(" ");
            else
                flag = true;
            printf("%d",*it1);
            it1++;
        }
        else
        {
            if (flag)
                printf(" ");
            else
                flag = true;
            printf("%d",*it2);
            it2++;
        }
    }
    if (it1==list1.end())
    {
        while(it2!=list2.end())
        {
            printf(" %d",*it2);
            it2++;
        }
    }
    if (it2==list2.end())
    {
        while(it1!=list1.end())
        {
           printf(" %d",*it1);
            it1++;
        }
    }
    printf("\n");
    return 0;
}

法3：纯c语言

#include<stdio.h>

typedef struct node *ptrNode;
typedef ptrNode LinkList;  //头结点
typedef ptrNode Position;//中间节点
typedef int ElementType;
struct node
{
    ElementType Element;
    Position next;
};

int IsEmpty(LinkList L)
{
    return L->next == NULL;
}
LinkList creatList(void)
{
    LinkList head,r,p;
    int x;
    head = (struct node*)malloc(sizeof(struct node));    //生成新结点
    r = head;
    scanf("%d",&x);
    while(x != -1)
    {
        p = (struct node*)malloc(sizeof(struct node));
        p->Element = x;
        r->next = p;
        r = p;
        scanf("%d",&x);
    }
    r->next = NULL;
    return head;
}
LinkList mergeList(LinkList a, LinkList b)
{
    Position ha, hb,hc;
    LinkList c,r,p;
    ha = a->next;
    hb = b->next;
    c = (struct node*)malloc(sizeof(struct node));
    r = c;
    while((ha != NULL)&&(hb != NULL))
    {
        p = (struct node*)malloc(sizeof(struct node));
        if(ha->Element <= hb->Element)
        {
            p->Element = ha->Element;
            ha = ha->next;
        }
        else
        {
            p->Element = hb->Element;
            hb = hb->next;
        }
        r->next = p;
        r = p;
    }
    if(ha == NULL)
    {
        while(hb != NULL)
        {
            p = (struct node*)malloc(sizeof(struct node));
            p->Element = hb->Element;
            hb = hb->next;
            r->next = p;
            r = p;
        }
    }
    if(hb == NULL)
    {
        while(ha != NULL)
        {
            p = (struct node*)malloc(sizeof(struct node));
            p->Element = ha->Element;
            ha = ha->next;
            r->next = p;
            r = p;
        }
    }
    r->next = NULL;
    return c;
}
void printList(LinkList L)
{
    LinkList hc;
    int flag = 0;
    hc = L->next;
    if(hc == NULL)
        printf("NULL");
    while(hc != NULL)
    {
        if(flag)
            printf(" ");
        else
            flag = 1;
        printf("%d",hc->Element);
        hc = hc->next;
    }
}
int main(void)
{
    LinkList L1,L2,L3;
    L1 = creatList();
    L2 = creatList();
    L3 = mergeList(L1,L2);
    printList(L3);
    return 0;
}