PTA- 两个有序链表序列的合并

已知两个非降序链表序列S1与S2，设计函数构造出S1与S2合并后的新的非降序链表S3。

输入格式:

输入分两行，分别在每行给出由若干个正整数构成的非降序序列，用−1表示序列的结尾（−1不属于这个序列）。数字用空格间隔。

输出格式:

在一行中输出合并后新的非降序链表，数字间用空格分开，结尾不能有多余空格；若新链表为空，输出NULL。

输入样例:

1 3 5 -1
2 4 6 8 10 -1

输出样例:

1 2 3 4 5 6 8 10

#define _CRT_SECURE_NO_WARNINGS 1
#include "stdio.h"
#include "malloc.h"
struct MyStruct
{
	int data;
	struct MyStruct* next;
};
typedef struct MyStruct* List;
List GetList();
List MergeList(List LA,List  LB);
void PrintList(List LC);
int main() {
	List LA, LB, LC;
	LA = GetList();
	//PrintList(LA);
	LB = GetList();
	//PrintList(LB);
	LC = MergeList(LA,LB);
	PrintList(LC);
	return 0;
}
List GetList() {
	List p=NULL, head=(List)malloc(sizeof(struct MyStruct));
	head->data = 0;
	head->next = NULL;
	int k;
	scanf("%d", &k);
	while (k != -1) {
		List s = (List)malloc(sizeof(struct MyStruct));
		s->data = k;
		s->next = NULL;
		if (p == NULL) {
		 p = s;
		 head->next = p;
		}
		else {
			p->next = s;
			p = s;
		}
		scanf("%d", &k);
	}
	return head;
}
List MergeList(List LA, List  LB) {
	List LC, pa, pb,pc;
	pa = LA->next;
	pb = LB->next;
	LC = LA;
	LC ->next = NULL;
	pc = LC;
	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;
		}
	}
	if (pa)
		pc->next = pa;
	else
		pc->next = pb;
	free(LB);
	return LC;
}
void PrintList(List LC) {
	int i = 0;
	LC = LC->next;
	if (LC == NULL) {
		printf("NULL");
	
	}
	while (LC) {
		if (i != 0) {
			printf(" ");
		}
		printf("%d", LC->data);
		i++;
		LC = LC->next;
	}
}