PTA数据结构与算法中文-两个有序链表序列的合并

函数：

List Merge( List L1, List L2 ) {
   
	List L3, head, temp, hL1, hL2;
	int data;
	head = (List)malloc(sizeof(struct Node));
	head->Next = NULL;
	L3 = head;
	hL1 = L1;
	hL2 = L2;


	for ( L1=L1->Next; L1; L1=L1->Next ) {
   
		temp = (List)malloc(sizeof(struct Node));
		temp->Data = L1->Data;
		temp->Next = NULL;
		L3->Next = temp;
		L3 = temp;
	}

	for ( L2=L2->Next; L2; L2 = L2->Next ) {
   
		data = L2->Data;
		if ( head->Next == NULL ) {
   
			temp = (List)malloc(sizeof(struct Node));
			temp->Data = data;
			temp->Next = NULL;
			L3->Next = temp;
			L3 = temp;
		} else if ( data >= L3->Data ) {
   
			temp = (List)<