王道数据结构41页第14题

void Create_C(LinkList &A, LinkList &B)
{
	LinkList p = A ->next , p1 = B -> next,C,r;
	C = (LinkList)malloc(sizeof(LNode));
	C->next = NULL;
	r = C;
	Show_List(C);
	while (p != NULL && p1 != NULL)
	{
		if (p->data > p1->data) 
		{
			p1 = p1->next;

		}
		else if (p->data < p1->data)
		{
			p = p-> next;
		}
		else if (p->data == p1->data)
		{
			LinkList s;
			s = (LinkList)malloc(sizeof(LNode));
			s->data = p->data;
			r->next = s;
			r = s;
			p1 = p1->next;
			p = p->next;
		}
		r->next = NULL;
	}
	Show_List(C);
}

无断链操作，创建了一个新链表，操作相对简单