leetcode349 Intersection of Two Arrays
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.
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
sort(nums1.begin(), nums1.end());
sort(nums2.begin(), nums2.end());
vector<int> result;
int size1 = nums1.size();
int size2 = nums2.size();
int i = 0;
int j = 0;
while (i < size1 && j < size2)
{
if (nums1[i] < nums2[j])
{
i++;
}
else if (nums1[i] > nums2[j])
{
j++;
}
else if (result.size() == 0 || result[result.size() - 1] != nums1[i])
{
result.push_back(nums1[i]);
i++;
j++;
}
else
{
i++;
j++;
}
}
return result;
}
};