#include <stdio.h>
#include <stdlib.h>
//单链表归并算法
typedef struct Node{
int data;
struct Node* next;
}Node,*LinkList;
int List_TailInsert(LinkList *L){
int x;
(*L)=(LinkList)malloc(sizeof(Node));
Node *s,
*r=(*L);
scanf("%d",&x);
while(x!=9999){
s=(LinkList)malloc(sizeof(Node));
s->data=x;
r->next=s;
r=s;
scanf("%d",&x);
}
r->next=NULL;
return 1;
}
void merge_L(LinkList *L1,LinkList *L2,LinkList *L3){
LinkList p1,p2,p3;
(*L3)=p3=*(L1);
p1=(*L1)->next;
p2=(*L2)->next;
while(p1&&p2){
if(p1->data<p2->data){