交叉合并两个带头结点的链表

今天在数据结构的mooc考试中，碰到一道算法题。
题目如下：
写这道题的时候，写的比较差（明明以前写过）
特此把以前写过的代码放上来，留作备份：
语言：C

#include<stdio.h>
#include<stdlib.h>
void merge();
typedef struct node
{
	int val;
	struct node *next;
}*LinkList,LNode;
LinkList creat_List(){
	LinkList l = (LinkList)malloc(sizeof(LNode));
	l->next = NULL;
	LNode *s,*r = l;
	int x;
	scanf("%d",&x);
	while(x!=-1){
		s = (LinkList)malloc(sizeof(LNode));
		s->val = x;
		r->next = s;
		r = s;
		printf("请输入下一结点的值：");
		scanf("%d",&x);
	}
	r->next = NULL;
	r = l->next;
	while(r!=NULL){
		printf("%d ",r->val);
		r= r->next;
	}
	printf("\n");
	return l;
}
void compare(LinkList la,LinkList lb)
{
	int sum1 = 0,sum2 = 0;
	LNode *p,*q;
	p = la->next;
	q = lb->next;
	while(p!=NULL)
	{
		p = p->next;
		sum1++;
	}
	while(q!=NULL)
	{
		q = q->next;
		sum2++;
	}
	if(sum1<=sum2)
	{
		merge(la,lb,1);
	}
	if(sum1>sum2)
	{
		merge(la,lb,0);
	}
}
void merge(LinkList la,LinkList lb,int flag)
{
	LinkList c;
	int flag1 = flag;
	LNode *p,*q,*t;
	p = la->next;
	q = lb->next;
	t = c;
	while(1)
	{
		if(p==NULL)
		{
			flag = 0;
		}
		if(q==NULL)
		{
			flag = 1;
		}
		if(p==NULL&&q==NULL)
		{
			break;
		}
		if(flag == 1)
		{
			t->next = p;
			t = t->next;
			p = p->next;
			flag = 0;
			continue;
		}
		if(flag == 0)
		{
		    t->next = q;
			t = t->next;
			q = q->next;
			flag = 1;
			continue;
		}
	}
	t->next = NULL;
	t = c->next;
	while(t!=NULL)
	{
		printf("%d ",t->val);
		t=t->next;
	}
}
int main()
{
	LinkList la,lb;
	printf("创建第一个链表！");
	la = creat_List();
	printf("创建第二个链表！");
	lb = creat_List();
	compare(la,lb);
}