一、题目
二、代码
class Solution
{
public int[] intersection(int[] nums1, int[] nums2)
{
Set<Integer> sets = new HashSet<>();
Set<Integer> mul_sets = new HashSet<>();
Integer i=0;
int j = 0;
int length = nums1.length;
for(i=0;i<length;i++)
{
sets.add(nums1[i]);
}
length = nums2.length;
for(i=0;i<length;i++)
{
if(sets.contains(nums2[i]))
{
mul_sets.add(nums2[i]);
}
}
length = mul_sets.size();
int[] return_array = new int[length];
for (Integer element : mul_sets)
{
return_array[j++]=element;
}
return return_array;
}
}
三、运行结果
四、附录
class Solution
{
public int[] intersection(int[] nums1, int[] nums2)
{
int i=0;
Set<Integer> set1 = new HashSet();
Set<Integer> set2 = new HashSet();
int length = nums1.length;
for(i=0;i<length;i++)
{
if(!set1.contains(nums1[i])) set1.add(nums1[i]);
}
length = nums2.length;
for(i=0;i<length;i++)
{
if(!set2.contains(nums2[i])) set2.add(nums2[i]);
}
length = 0;
for(Integer num:set1)
{
if(set2.contains(num)) length++;
}
int index= 0;
int[] re_int = new int[length];
for(Integer num:set1)
{
if(set2.contains(num)) re_int[index++] = num;
}
return re_int;
}
}