# 【leetcode】Intersection of Two Arrays II

64人阅读 评论(0)

### Question

Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

### Code

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

class Solution {
public:
vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
if (nums1.empty())
return nums1;
else if (nums2.empty())
return nums2;
sort(nums1.begin(), nums1.end());
sort(nums2.begin(), nums2.end());
vector<int>res;
for (int i = 0, j = 0; i < nums1.size() && j < nums2.size();) {
if (nums1[i] < nums2[j])
i++;
else if (nums1[i] > nums2[j])
j++;
else {
res.push_back(nums1[i]);
i++;
j++;
}
}
return res;
}
};

int main() {
Solution so;
vector<int>nums1 = {1,2,2,1};
vector<int>nums2 = {2,2};
vector<int>res;
res = so.intersect(nums1, nums2);
for (vector<int>::iterator it = res.begin(); it != res.end(); it++) {
cout << *it << " ";
}
cout << endl;
system("pause");
return 0;
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：6352次
• 积分：557
• 等级：
• 排名：千里之外
• 原创：52篇
• 转载：0篇
• 译文：0篇
• 评论：0条
评论排行