LeetCode Problem
349. Intersection of Two Arrays
Link to LeetCode
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.
note : The intersection of two arrays is defined as the set of elements that are present in both arrays.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Explanation: [4,9] is also accepted.
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
Set< Integer> set1 = new HashSet<>();
for (int num : nums1) {
set1.add(num);
}
HashSet< Integer> set2 = new HashSet< Integer>();
for(int i: nums2){
if(set1.contains(i)){
set2.add(i);
}
}
int []result = new int[set2.size()];
int i=0;
for (Integer num : set2) {
result[i++] = num;
}
return result;
}
}