数据结构与算法每日一题——链表(160. 相交链表)

160. 相交链表

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */

/**
 * @param {ListNode} headA
 * @param {ListNode} headB
 * @return {ListNode}
 */
var getIntersectionNode = function (headA, headB) {
    if(headA ==null || headB == null){return null}
    let p1 = headA
    let p2 = headB
    while (p1 !== p2) {
        if (p1 === null) {
            p1 = headB
        } else {
            p1 = p1.next
        }
        if (p2 === null) {
            p2 = headA
        } else {
            p2 = p2.next
        }
    }
    return p1
};