HashSet的声明与遍历
HashSet<Integer> set = new HashSet<Integer>();
Iterator<Integer> iterator = s while(iterator.hasNext()) {
ans[index++] = iterator.next();
}et.iterator();
code:
public class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
HashSet<Integer> set = new HashSet<Integer>();
for(int i = 0;i < nums2.length; ++i) {
for(int j = 0;j < nums1.length;++j){
if(nums1[j] == nums2[i]) {
set.add(nums1[j]);
break;
}
}
}
int[] ans = new int[set.size()];
Iterator<Integer> iterator = set.iterator();
int index = 0;
while(iterator.hasNext()) {
ans[index++] = iterator.next();
}
return ans;
}
}