//法2
int l1=0,l2=0,diff=0;//分别记录两个链表的长度,和长度的差值
ListNode pa=headA,pb=headB;
while(pa!=null){
l1++;
pa=pa.next;
}
while(pb!=null){
l2++;
pb=pb.next;
}
pa=headA;
pb=headB;
if(l2>l1){
diff=l2-l1;
for(int i=0;i<diff;i++){
pb=pb.next;
}
}else{
diff=l1-l2;
for(int i=0;i<diff;i++){
pa=pa.next;
}
}
while(pa!=pb){
pa=pa.next;
pb=pb.next;
if(pa==pb){
return pa;
}
}
return null;