【leetcode】Intersection of Two Arrays II

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;
}

leetcode_350 Intersection of Two Arrays II

2016-05-28 18:17:30

LeetCode 350. Intersection of Two Arrays II（数组交集）

2016-05-25 01:35:00

Leetcode 349. Intersection of Two Arrays 解题报告 Python Java

2016-05-18 23:30:59

Leetcode 350. Intersection of Two Arrays II 数组交集2 解题报告

2016-05-24 11:11:35

Intersection of Two Arrays II两个数组交集（重要！）

2016-06-26 23:21:28

leetcode_349 Intersection of Two Arrays

2016-05-28 18:13:55

[leetcode] 350. Intersection of Two Arrays II 解题报告

2016-05-23 13:21:22

350. Intersection of Two Arrays II [easy] (Python)

2016-05-25 10:15:52

LeetCode 349. Intersection of Two Arrays 题解（C++）

2016-10-11 15:44:20

349. Intersection of Two Arrays I &&II (Java)

2016-05-27 12:56:58