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

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
       ListNode node1 = pHead1;
       ListNode node2 = pHead2;
       Set<ListNode>  set = new HashSet<>();
       while(node1 != null){
           set.add(node1);
           node1 = node1.next;
       }
        while(node2 != null){
           if(set.contains(node2)){
               return node2;
        }
           node2 = node2.next;
       }
        return null;
    }
}