【链表】merge两个非递减的链表为一个非递减的链表

LinkList *MergeList(LinkList *la, LinkList *lb)
{
	LinkList *lc,*pa,*pb,*pc;
	lc = pc = la;
	pa = la->next;
	pb = lb->next;
	
	while(pa != NULL && pb !=NULL)
	{
		if(pa->data <= pb->data)
		{
			pc->next = pa;
			pc = pa;
			pa = pa->next;
		}
		else
		{
			pc->next = pb;
			pc = pb;
			pb = pb->next;
		}
	}
	
	//pa == NULL ? pc->next = pb : pc->next = pa;
	pc->next = pa ? pa : pb;
	
	free(lb);
	
	return lc;
}