Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, return [2]
.
Note:
- Each element in the result must be unique.
- The result can be in any order.
查看交叉集合的问题
public class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> a1=new HashSet<>();
Set<Integer> intersection=new HashSet<>();
for(int i=0;i<nums1.length;i++)
{
a1.add(nums1[i]);
}
for(Integer c:nums2)
{
if(a1.contains(c))
{
intersection.add(c);
}
}
int[] xresult=new int[intersection.size()];
/*for (Integer num : intersect) {//这种方法可以直接读取集合内容
xresult[j++] = num;
}*/
Iterator it = intersection.iterator();
int j=0;
while(it.hasNext())
{
xresult[j++]=(int)it.next();
}
return xresult;
}
}