设ha=(a1,a2,...,an)和hb=(b1,b2,...,bm)是两个带头结点的循环单链表

设ha=(a1,a2,...,an)和hb=(b1,b2,...,bm)是两个带头结点的循环单链表

#include
struct listNode
{
int data;
node* next;
}node;
node *ha, *hb,*hc;
node* create(int t)
{
int i=1;
node *head,*p,*r;
head=new node;
p=head;
p->next=head;
while(idata=i;
r->next=head;
p->next=r;
p=r;
i++;
}
return head;
}
node* merge(node* ha,node* hb)
{
node *head,*p;
head = new node;
head->next=ha->next;
for(p=ha->next;p->next!=ha;p=p->next);
p->next=hb->next;
for(;p->next!=hb;p=p->next);
p->next=hc;
delete ha;
delete hb;
return head;
}
void print(node *p)
{
p=p->next;
cout