LeetCode : 349. Intersection of Two Arrays

[congr]

https://leetcode.com/problems/intersection-of-two-arrays/

[congr]

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Set<Integer> set = new HashSet();
        Set<Integer> intersect = new HashSet();

        for (int n : nums1) set.add(n);
        for (int n : nums2) 
            if (set.contains(n)) intersect.add(n);

        int i = 0;
        int[] res = new int[intersect.size()];
        for (int n : intersect) res[i++] = n;
        return res;
    }
}