输入两个链表,找出它们的第一个公共结点。
function FindFirstCommonNode(pHead1, pHead2){// write code herelet p1 = pHead1let p2 = pHead2while(p1 !== p2){p1=p1==null?pHead2:p1.next;p2=p2==null?pHead1:p2.next;}return p1}module.exports = {FindFirstCommonNode : FindFirstCommonNode};