- 给你两个单链表的头节点 headA 和 headB ,请你找出并返回两个单链表相交的起始节点。如果两个链表没有交点,返回 null 。
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA==null || headB==null){
return null;
}
ListNode pA = headA;
ListNode pB = headB;
int lenA = 0;
int lenB = 0;
while(pA != null){
lenA++;
pA = pA.next;
}
while(pB != null){
lenB++;
pB = pB.next;
}
int k = Math.abs(lenA-lenB);
ListNode curA = headA;
ListNode curB = headB;
if(lenB > lenA){
curA = headB;
curB = headA;
}
while(k>0){
k--;
curA = curA.next;
}
while(curA!=curB && curA!=null && curB!=null){
curA = curA.next;
curB = curB.next;
}
if(curA == curB){
return curA;
}
else{
return null;
}
}