题解 | #两个链表的第一个公共结点#

/*function ListNode(x){
    this.val = x;
    this.next = null;
}*/
function FindFirstCommonNode(l1, l2)
{
    if (!l1 || !l2) return null;
    
    let p1 = l1;
    let p2 = l2;
    
    while (p1 !== p2) {
        
        p1 = p1 === null ? l2 : p1.next;;
        p2 = p2 === null ? l1 : p2.next;
    }
    
    return p1;
}
module.exports = {
    FindFirstCommonNode : FindFirstCommonNode
};