每天一算：Intersection of Two Arrays II

 1// 350. Intersection of Two Arrays II
 2// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
 3// 时间复杂度: O(nlogn)
 4// 空间复杂度: O(n)
 5class Solution {
 6public:
 7    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
 8
 9        map<int, int> record;
10        for(int i = 0 ; i < nums1.size() ; i ++){
11             record[nums1[i]] += 1;
12        }
13
14        vector<int> resultVector;
15        for(int i = 0 ; i < nums2.size() ; i ++){
16            if(record[nums2[i]] > 0){
17                resultVector.push_back(nums2[i]);
18                record[nums2[i]] --;
19            }
20        }
21
22        return resultVector;
23    }
24};