#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct LNode{
    ElemType data;
    struct LNode *next;    
}LNode,*LinkList;

//尾插法 
 LinkList List_TailInsert(LinkList &L)
 {
     ElemType x;
     L=(LinkList)malloc(sizeof(LNode));
     LNode *s,*r=L;
     printf("
 
請輸入單鏈表各個節點，以9999結束！\n"); 
     scanf("%d",&x);
     while(x!=9999)
     {
         s=(LNode*)malloc(sizeof(LNode));
         s->data=x;
         r->next=s;
         r=s;
         scanf("%d",&x);
             
     }
     
     r->next=NULL;
     
     return L;
    
  }
   int Length(LinkList L)
 {
     LNode 
 
*p=L;
     int count=0;
     while(p->next!=NULL)
     {
         p=p->next;
         count++;
     }
     return count;
     
 }
 void Union(LinkList &la,LinkList &lb){
     LNode *pa,*pb,*pc,*u;
     pa=la->next;
     pb=lb->next;
     while(pa&&pb)
     {
     
         
 
if(pa->data==pb->data)
         {
             pc->next=pa;
             pc=pa;
             pa=pa->next;
             u=pb;
             pb=pb->next;
             free(u);
             
         }
         else if(pa->data<pb->data)
         {
             u=pa;
             pa=pa->next;
             free(u);
         }
         else
         {
             
             u=pb;
             pb=pb->next;
             free(u);
             
         }
         
         
         
     }
     while(pa)
     {
         u=pa;
        pa=pa->next;
        free(u);
     }
    while(pb)
     {
         u=pb;
        pb=pb->next;
        free(u);
     }
     pc->next=NULL;
     free(lb);
     
     
 } 
 
 
  int main(){
    LinkList L1,L2;
    LinkList R,S,C;
    R=List_TailInsert(L1);
    S=List_TailInsert(L2);
    Union(R,S);
    LNode *p=R;
    while(p->next!=NULL){
        p=p->next;
        printf("->%d",p->data);
        
    }
    
}