王道ch1-LinkList13.A，B递增排列，将两个单链表归并为递减序列，用原来的结点存放

//任务：A，B递增排列，将两个单链表归并为递减序列，用原来的结点存放
//算法思想：摘下A的头结点，两个链表依次比较，较小的头插法放入A中。
void Merge(LinkList& A, LinkList& B)
{
	LNode* pa=A->next, * pb=B->next, * ra, * rb;
	A->next = NULL;
	while (pa&&pb)
	{
		if (pa->data < pb->data)
		{
			ra = pa->next;
			pa->next = A->next;
			A->next = pa;
			pa = ra;
		}
		else
		{
			rb = pb->next;
			pb->next = A->next;
			A->next = pb;
			pb = rb;
		}
	}
	while (pa)
		pb = pa;
	while (pb)
	{
		rb = pb->next;
		pb->next = A->next;
		A->next = pb;
		pb = rb;

	}
}