将la,lb链表合并成lc。

#include<stdio.h>
#include<malloc.h>
typedef struct list 
{
int data;
struct list *next;
}node,*link;
//============================
//创建链表
//============================


void  create(link &l, int n)
{
int i=1;
link p,q,New;
p=(link)malloc(sizeof(node));
printf("请输入第%d个结点的值:",i);
scanf("%d",&p->data);
l=p;
for(i=2;i<=n;i++)
{
New=(link)malloc(sizeof(node));
if(!New)
printf("内存不足!!!");
printf("请输入第%d个结点的值:",i);
scanf("%d",&New->data);
q=p;
p->next=New;
p=New;
}
p->next=NULL;

}
//============================
//打印链表
//============================
void print(link l)
{
link m;
m=l;
while(m!=NULL)
{
printf("%d\t",m->data);
m=m->next;
}
}
//===============================
//将la,lb链表连接成lc
//===============================
void circular(link &lc,link la,link lb)
{
    link p,q;
lc=la;
p=la;
while(p->next!=NULL)
p=p->next;
p->next=lb;
}


void main()
{
int n,m;
link la,lb,lc;
printf("请输入链表la结点的个数:");
scanf("%d",&n);
create(la,n);
printf("链表la的元素是:\n");
    print(la);
printf("\n");
printf("请输入链表lb结点的个数:");
scanf("%d",&m);
create(lb,m);
printf("链表lb的元素是:\n");
    print(lb);
printf("\n");
circular(lc,la,lb);
printf("链表lc的元素是:\n");
    print(lc);
printf("\n");
}