leetcode-algorithms/src/IntersectionOf2LinkedLists.java at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
import java.util.HashSet;
import java.util.Set;

public class IntersectionOf2LinkedLists {

    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        Set<ListNode> aNodes = new HashSet<>();
        while (headA != null) {
            aNodes.add(headA);
            headA = headA.next;
        }
        while (headB != null) {
            if (aNodes.contains(headB)) {
                return headB;
            }
            headB = headB.next;
        }
        return null;
    }
}