Intersection of Two Arrays
349.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.
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.
Violent Solution
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
if(nums1 == null || nums2 == null) return null;
Set<Integer> s1 = new HashSet<>();
Set<Integer> s2 = new HashSet<>();
for(int i:nums1){
s1.add(i);
}
for(int i:nums2){
s2.add(i);
}
List<Integer> list = new ArrayList<>();
for(int i:s1){
if(s2.contains(i)){
list.add(i);
}
}
int[] nums = new int[list.size()];
int index = 0;
for(int i:list){
nums[index] = i;
index++;
}
return nums;
}
}