Apache's ArrayUtils has this (it still iterates behind the scenes):
doSomething(ArrayUtils.toPrimitive(hashset.toArray()));
此题的标签为:Binary Search、Hash Table、Two Pointers Sort
我的解法是直接用了hashset来做:
public class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
if(nums1.length==0||nums2.length==0)
return new int[0];
Set<Integer> result = new HashSet();
Set<Integer> set1 = new HashSet();
for(int i=0;i<nums1.length;i++){
set1.add(nums1[i]);
}
for(int i=0;i<nums2.length;i++){
if(set1.contains(nums2[i]))
result.add(nums2[i]);
}
int[] res = new int[result.size()];
int i=0;
Iterator iter = result.iterator();
while(iter.hasNext()){
res[i++]=(int)iter.next();
}
return res;
}
}
还有一种是排序后,用两个指针分别遍历判断重叠部分。
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
std::sort(nums1.begin(), nums1.end());
std::sort(nums2.begin(), nums2.end());
vector<int> ans;
int i = 0, j = 0;
while (i < nums1.size() && j < nums2.size())
{
if (nums1[i] < nums2[j])
i++;
else if (nums1[i] > nums2[j])
j++;
else
{
if (!ans.size() || ans.back() != nums1[i])
ans.push_back(nums1[i]);
i++;
j++;
}
}
return ans;
}
};
附:把set<Integer>转为int[] 稍微有点困难,用toArray方法不能直接解决问题。
还是需要一个一个的转:
|
Apache's ArrayUtils has this (it still iterates behind the scenes):
|