链表1为A+C. 链表2为B+C.
当两个指针都走过程度A+B+C时会相遇, 若C=0,相遇时节点为null
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA==null || headB==null) return null;
ListNode i=headA,j=headB;
while(i!=j){
i= i==null?headB:i.next;
j= j==null?headA:j.next;
}
return j;
}
}