daima

lianbiaohebing

LinkList Read(){ 
    LinkList L,rear, temp;
    ElemType data;
    L = (LinkList)malloc(sizeof(LNode)); /* 链表头空结点*/
    L->data = -1;
    L->next = NULL;
    rear = L;
    scanf("%d", &data);
    while(data!=-1){
        temp = (LinkList)malloc(sizeof(LNode));
        temp->data = data;
        //printf("Write:%d\n", temp->Data);
        temp->next = NULL;
        rear->next = temp;
        rear = rear->next;
        scanf("%d", &data);
    }
    return L; 
}

LinkList Merge(LinkList L1, LinkList L2){
    
    LinkList L, pa, pb, rear;
    L = (LinkList)malloc(sizeof(LNode));
    L->data = -1;
    L->next = NULL;
    rear = L; 
    pa = L1->next;
    pb = L2->next;
    if(L1->next==NULL&&L2->next==NULL)
        return 0;
   
    while(pa&&pb){
        if(pa->data < pb->data){
            rear->next = pa;
            
            pa = pa->next;
        }
        else{
            rear->next = pb;
            
            pb = pb->next;
        }
        rear = rear->next;
    }
    while(pa){
        rear->next = pa;
        
        pa = pa->next;
        rear = rear->next;
    }
    while(pb){
        rear->next = pb;
        
        pb = pb->next;
        rear = rear->next;
    }
    rear->next = NULL;
    
    return L;
}