#include
using namespace std;
struct Node
{
int data;
Node*next;
};
Node*head_Create()
{
Node*head,*p,*q;
int m,n;//元素的输入
q=head=new Node;//建立节点
cout<<"请输入数据";
for(cin>>n;n!=-1;cin>>n)
{
p=new Node;
p->data=n;
head->next=p;
head=p;
}
cout<<"请再次输入数据";
for(cin>>m;m!=-1;cin>>m)
{
q=new Node;
q->data=m;
head->next=q;
head=q;
}
return head;
}
void Merge(Node*p,Node*q)
{
Node *pa,*pb,*pc,*tail;
pa=p->next;
pb=q->next;
tail=p;
tail->next=NULL;
while(pa!=NULL&&pb!=NULL)
{
if(pa->data<=pb->data)
{
pc->data=pb->data;
pa=pa->next;
}
else
{
pb=pb->next;
}
pc->next=tail->next;
tail->next=pc;
tail=pc;
}
cout<<pc;
}
int main()
{
Node*head,*p,*q;
head=head_Create();
Merge(p,q);
return 0;
}