append函数 两非递减链表的合并

<pre name="code" class="cpp">#include<iostream>
using namespace std;
typedef struct Node
{
	int data;
	Node *next;
}lnode,*list;
list listinit()
{
	list L;
	L=(lnode*)malloc(sizeof(list));
	if(L==NULL)
		cout<<"没有足够的内存空间!"<<endl;
	L->next=NULL;
	return L;
}
list listcreateTail()//Tail
{
	int i,len,data;
	list L,p,r;
	L=(lnode*)malloc(sizeof(list));
	L->next=NULL;
	r=L;
	cout<<"input the length of this list:"<<endl;
	cin>>len;
	cout<<"input the data of this list:"<<endl;
//	cin>>data;
	for(i=0;i<len;i++)
	{
		cin>>data;
		p=(lnode*)malloc(sizeof(list));
		p->data=data;
		r->next=p;
		r=p;
		
	}
	r->next=NULL;
	return L;
}
list merge(list l1,list l2)
{
    if(l1==NULL||l2==NULL)
	   return;
	list p,q,r,head;
	p=l1->next;
	q=l2->next;
	r=(lnode*)malloc(sizeof(list));//1->2->3 和 2->3->5 并为 1->2->3->5
	r->next=NULL;
	head=r;
	while(p&&q)
	{
		if(p->data==q->data)
		{
			r->next=p;
			r=p;
			p=p->next;
			q=q->next;
		}
		else if(p->data<q->data)
		{
			r->next=p;
			r=p;
			p=p->next;
		}
		else 
		{
			r->next=q;
			r=q;
			q=q->next;
		}
	}
	while(p)
	{
		r->next=p;
		p=p->next;
	}
	while(q)
	{
		r->next=q;
		q=q->next;
	}
	return head;



}
void output(list L)
{
	list p;
	p=L->next;
	while(p)
	{
		cout<<p->data<<" ";
		p=p->next;
	}
	cout<<endl;
}
int main()
{
	list l1,l2,l3;
	l1=listcreateTail();
	output(l1);
	l2=listcreateTail();
	output(l2);
	l3=merge(l1,l2);
	output(l3);
	system("pause");
	return 0;
}