![在这里插入图片描述](https://img-blog.csdnimg.cn/f3e42dde21df43aa821183df9b9258a6.png)
提交
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> set1 = new HashSet<>();
for(Integer i : nums1){
set1.add(i);
}
Set<Integer> set2 = new HashSet<>();
for(Integer i : nums2){
set2.add(i);
}
Set<Integer> result = new HashSet<>();
result.addAll(set1);
result.retainAll(set2);
int[] arr = new int [result.size()];
int i = 0;
for(int set_ele : result){
arr[i] = set_ele;
i++;
}
return arr;
}
}
本地调用测试
package leetcode;
import java.util.HashSet;
import java.util.Set;
public class lc_349_intersection {
public static void main(String[] args){
int[] nums1 = new int[]{1,2,2,1};
int[] nums2 = new int[]{2,2};
lc_349_intersection x = new lc_349_intersection();
nums1 = x.intersection(nums1, nums2);
for(int i = 0; i < nums1.length; i++){
System.out.println(nums1[i]);
}
}
public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> set1 = new HashSet<>();
for(Integer i : nums1){
set1.add(i);
}
Set<Integer> set2 = new HashSet<>();
for(Integer i : nums2){
set2.add(i);
}
Set<Integer> result = new HashSet<>();
result.addAll(set1);
result.retainAll(set2);
int[] arr = new int [result.size()];
int i = 0;
for(int set_ele : result){
arr[i] = set_ele;
i++;
}
return arr;
}
}