两个链表的合并代码.txt

#include <iostream>

using namespace std;

struct List
{
    int  value;
    List* next;
};

List* listb(int n)
{
    List* root=new List,*p=root;

    cout<<"输入链表数据："<<endl;
    while(n--)
    {
        List *x = new List;
        cin>>x->value;
        x->next=NULL;
        p->next=x;
        p=p->next;
    }
    return root->next;

}

void output(List* p)
{
    cout<<"链表: ";