#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef struct LinkedList{
int data;
struct LinkedList *next;
}LinkedList,*List;
int a[5]={1,2,3,4,5};
int b[5]={3,4,5,6,7};
int n=5;
void build(List &L1,List &L2){
L1=(List)malloc(sizeof(LinkedList));
LinkedList *s1;
LinkedList *r1=L1;
L2=(List)malloc(sizeof(LinkedList));
LinkedList *s2;
LinkedList *r2=L2;
for(int i=0;i<n;i++){
s1=(LinkedList *)malloc(sizeof(LinkedList));
s1->data=a[i];
r1->next=s1;
r1=r1->next;
s2=(LinkedList *)malloc(sizeof(LinkedList));
s2->data=b[i];
r2->next=s2;
r2=r2->next;
}
r1->next=NULL;
r2->next=NULL;
}
void show(List &L){
LinkedList *s=L->next;
while(s){
printf("%d ",s->data);
s=s->next;
}
}
void findCommen(List &L1,List &L2){
LinkedList *p1=L1->next;
LinkedList *p2;
LinkedList *r=L1;
LinkedList *k=p1->next;
L1->next=NULL;
while(p1){
p2=L2->next;
while(p2){
if(p1->data==p2->data){
p1->next=r->next;
r->next=p1;
r=r->next;
}
p2=p2->next;
}
p1=k;
if(k!=NULL){
//这里不能用p1的next判断因为我们在上面的while中已经更改了p1的指向
//判断k是否为空不能省略
k=k->next;
}
}
}
int main(){
List L1,L2;
build(L1,L2);
show(L1);
printf("\n");
show(L2);
findCommen(L1,L2);
printf("\n");
show(L1);
}