160. 相交链表
难度:Low
掌握程度:Low
原理是这样的,n1比n2走的快一步(因为n1比较少),所以n1是先走完的,闲着了,所以现在指派n1去B的头部,好,n2终于走完了,现在可以指派N2去A的头部,走两步就相交了
var getIntersectionNode = function(headA, headB) {
let n1 = headA;
let n2 = headB;
while(n1 !== n2){
if(n1 === null){
n1 = headB;
}else{
n1 = n1.next;
}
if(n2 === null){
n2 = headA;
}else{
n2 = n2.next;
}
}
return n1;
};