题目

https://leetcode-cn.com/problems/intersection-of-two-linked-lists/

解题

  1. /**
  2.  * Definition for singly-linked list.
  3.  * function ListNode(val) {
  4.  *     this.val = val;
  5.  *     this.next = null;
  6.  * }
  7.  */
  9. /**
  10.  * @param {ListNode} headA
  11.  * @param {ListNode} headB
  12.  * @return {ListNode}
  13.  */
  14.  var getIntersectionNode = function(headA, headB) {
  15.   if(headA === null || headB === null) {
  16.       return null
  17.   }
  18.   let pa = headA
  19.   let pb = headB 
  21.   // pa和pb相遇 就是要找的节点
  22.   while(pa !== pb) {
  25.       pa = pa === null ? headB : pa.next
  26.       pb = pb === null ? headA : pb.next
  28.   }
  30.   return pa
  31. };