相交的链表

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

给你两个单链表的头节点 headA 和 headB ，请你找出并返回两个单链表相交的起始节点。如果两个链表没有交点，返回 null 。

/**
 * @param {ListNode} headA
 * @param {ListNode} headB
 * @return {ListNode}
 */
 var getIntersectionNode = function(headA, headB) {
    
    let anode=headA
    let arr=[]
    while(anode){
       
        arr.push(anode)
        anode=anode.next
    }
    let bnode=headB
    while(bnode){
        if(arr.includes( bnode)){
            return bnode
        }

        bnode=bnode.next
    }

    return null
    
};

/**
 * @param {ListNode} headA
 * @param {ListNode} headB
 * @return {ListNode}
 */
 var getIntersectionNode = function(headA, headB) {
    
    let anode=headA
    while(anode){
        let bnode=headB
        while(bnode){
           if(anode===bnode){
               return anode
           }
           bnode=bnode.next
        }
        anode=anode.next
    }
};