链表合并（非递减有序排列）

void MergeList_L(LinkList& La, LinkList& Lb, LinkList& Lc) {
	//已知单链表La和Lb的元素是非递减排序，将两个表合并成Lc，Lc也是非递减排列
	LNode* pa, * pb, * pc;
	pa = pa->next; pb = pb->next;
	Lc = pc = La;//用La的头节点作为Lc的头结点
	while (pa && pc) {
		if (pa->data <= pb->data) {
			pc->next = pa; pc = pa; pa->next;
		}
		else {
			pc->next = pb; pc = pb; pb->next;
		}
		pc->next = pa ? pa : pb;
		free(Lb);
	}
}//MergeList_L