#include<iostream.h>
#include<stdlib.h>
int n;
typedef struct node{
    int data;
    int length;
    struct node *next;
}node, * list;
void createlist(list *L)
{int i;
    *L=(list)malloc(sizeof(node));
    (*L)->next=NULL;
    list p,r;
    r=*L;
    cout<<"enter data's number:";
cin>>n;
(*L)->length=n;
    cout<<"enter data:";
for(i=0;i<n;i++)
{
    p=(list)malloc(sizeof(node));
    cin>>p->data;
    r->next=p;
    r=p;
}
r->next=*L;
}
void outputlist(list *L)
{
cout<<"your list is:"<<endl;
for(int i=0;i<n;i++)
{cout<<(*L)->next->data<<"\t";
*L=(*L)->next;
}
cout<<endl;
}
void mergelist(list *L1,list *L2)
{list L3;
L3=(*L1)->next;
list q,s;
q=*L1;
s=*L2;
while(q->next!=*L1)
{q=q->next;}
while(s->next!=*L2)
{s=s->next;}
s->next=*L1;
q->next=(*L2)->next;
free(*L2);
cout<<"the news cirsulate list is:";
n=(*L1)->length+(*L2)->length;
for(int i=0;i<n;i++)
{
cout<<L3->data;
(L3)=(L3)->next;
}
cout<<endl;
}
int main()
{list L1,L2;
createlist(&L1);
outputlist(&L1);
createlist(&L2);
outputlist(&L2);
mergelist(&L1,&L2);
return 0;
}

#include<iostream.h>
#include<math.h>
#include<stdlib.h>
int n,n1,n2;;
typedef struct node{
    int data;
    struct node *next;
}node, * list;
void createlist(list *L)
{int i;
    *L=(list)malloc(sizeof(node));
    (*L)->next=NULL;
    list p,r;
    r=*L;
    cout<<"enter data's number:";
cin>>n;
    cout<<"enter data:";
for(i=0;i<n;i++)
{
    p=(list)malloc(sizeof(node));
    cin>>p->data;
    r->next=p;
    r=p;
}
p->next=*L;
}
void outputlist(list *L)
{
cout<<"your list is:"<<endl;
list j;
j=*L;
for(int i=0;i<n;i++)
{cout<<j->next->data<<"\t";
j=j->next;
}
cout<<endl;
}
void mergelist(list *L1,list *L2,list *L3)
{
list q,s;
*L3=*L1;
q=*L1;
s=*L2;
while(q->next!=*L1)
q=q->next;
while(s->next!=*L2)
s=s->next;
s->next=*L1;
q->next=(*L2)->next;
free(*L2);
cout<<endl;
}
void outputnlist(list *L)
{
    cout<<"combined list is:"<<endl;
n=n1+n2;
for(int i=0;i<n;i++)
{cout<<(*L)->next->data<<"\t";
(*L)=(*L)->next;
}
cout<<endl;
}
int main()
{

    list L1,L2,L3;
createlist(&L1);
n1=n;
outputlist(&L1);
createlist(&L2);
n2=n;
outputlist(&L2);
mergelist(&L1,&L2,&L3);
outputnlist(&L3);
return 0;
}

什麽叫循環鏈表啊？