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