Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
别人的思路 我还是太菜了！
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
vector<int> ans;
sort(nums1.begin(),nums1.end());
sort(nums2.begin(),nums2.end());
int i,j;
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(nums1[i] == nums2[j])
{
if(ans.empty() || ans.back() != nums1[i])
ans.push_back(nums1[i]);
i++;
j++;
}
}
return ans;
}
};
(leetcode)349. Intersection of Two Arrays
原文：http://www.cnblogs.com/chdxiaoming/p/5793625.html