LeetCode350. Intersection of Two Arrays II

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

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

Note:

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

Follow up:

• What if the given array is already sorted? How would you optimize your algorithm?
• What if nums1's size is small compared to nums2's size? Which algorithm is better?
• What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

这道题我们使用map来记录nums1的数各出现了多少次；然后我们遍历nums2，将map中相同的数减一，当map中该数的统计大于0时就说明该数在两个数组中都出现了。

class Solution {
public:
	vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
		map<int, int> m;
		for (int num : nums1) m[num]++;
		vector<int> ans;
		for (int num : nums2) {
			m[num]--;
			if (m[num] >= 0) ans.push_back(num);
		}
		return ans;
	}
};