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

/*function ListNode(x){
    this.val = x;
    this.next = null;
}*/
function FindFirstCommonNode(pHead1, pHead2)
{
  if (pHead1 === null || pHead2 === null) {
    return null
  }
  let result = {
    val: -1,
    next: null
  }
  let node = result
  
  while (pHead1) {
    let p2 = pHead2
    while (p2) {
      if (pHead1 === p2) {
        node.next = pHead1
        node = node.next
      }
      p2 = p2.next
    }
    pHead1 = pHead1.next
  }
  
  return result.next
}
module.exports = {
    FindFirstCommonNode : FindFirstCommonNode
};