public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA == null || headB == null){
return null;
}
ListNode a = headA,b = headB;
while(a != b){
a = a == null ? headB : a.next;
b = b == null ? headA : b.next;
} //1 2 3 A 4 5
//6 7 A 4 5
//123A4567A45
//67A45123A45
//A总会在同一位置碰到
return a;
}
}