classSolution{publicint[]intersection(int[] nums1,int[] nums2){HashSet<Integer> set =newHashSet<>();HashSet<Integer> resultSet =newHashSet<>();for(int num : nums1){
set.add(num);}for(int num : nums2){if(set.contains(num)){
resultSet.add(num);}}int index =0;int[] result =newint[resultSet.size()];for(int i : resultSet){
result[index++]= i;}return result;}}