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