思想:两个链表走相同数量的步伐
链表1 :1,2,3,6,7,4,5,6
链表2 :4,5,6,7,1,2,3,6
步伐都是8
import java.util.*;
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
public class FindFirst{
public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
ListNode p1= pHead1, p2= pHead2;
while(pHead1!=pHead2){
pHead1=pHead1.next;
if(pHead1==null){
pHead1=p2;
}
pHead2=pHead2.next;
if(pHead2==null){
pHead2=p1;
}
}
return pHead1;
}
}