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

//建立連結串列
LinkList *CreatLink(LinkList *head,int num){
LinkList *h,*p;
head=(LinkList*)malloc(sizeof(LinkList));
head->next=NULL;
h=head;
for(int i=0;i<num;i++){
p=(LinkList*)malloc(sizeof(LinkList));
scanf("%d",&p->data);
p->next=head->next;
head->next=p;
}
return head;
} 
//排序
LinkList *sortlink(LinkList *head){
LinkList *p,*q;
int temp;
for(p=head->next;p!=NULL;p=p->next){
for(q=p;q!=NULL;q=q->next){
if(p->data>q->data){
temp=p->data;
p->data=q->data;
q->data=temp;
}
}
}
return head;

} 
//查集 
LinkList *Sublink(LinkList *head,LinkList *head1,LinkList *head2){
LinkList *p,*p1,*p2;
head=(LinkList*)malloc(sizeof(LinkList));
head->next=NULL;
p1=head1->next;
p2=head2->next;
head=p=head1; 
while(p1&&p2){
if(p1->data==p2->data){
p->next=p1->next;free(p1);p1=p->next;
}else if(p1->data<p2->data){
p=p1;
p1=p1->next;
}else{
p2=p2->next;
}
}
p2=head2;
while(p2){
p=p2;
p2=p2->next;
free(p);
}
return head;
}
//列印列表
void printlink(LinkList *head){
LinkList *p;
p=head->next;
if(!p){
printf("The link is nothing!");
exit(0);
}
while(p){
printf("%d  ",p->data);
p=p->next;
}

} 

int main(){
LinkList *head,*head1,*head2;
int num1,num2;

printf("The first link legth:");
scanf("%d",&num1);
head1=CreatLink(head1,num1);
sortlink(head1);
printlink(head1);
printf("\n");

printf("The second link legth:");
scanf("%d",&num2);
head2=CreatLink(head2,num2);
sortlink(head2);
printlink(head2);
printf("\n");

head=Sublink(head,head1,head2);
printf("查集連結串列為："); 
printlink(head);
}