leetcode-350-Intersection-of-Two-Arrays-II

发表于   |  

描述

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.

分析

思路和Intersection of Two Arrays一样，只不过要把集合改成数组，这样就能保留重复的元素

解决方案1(C++)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        unordered_map<int, int> map_int_int;
        vector<int> result;
        
        for(auto &a: nums1) {
            map_int_int[a]++;
        }
        
        for(auto &b: nums2) {
            if(map_int_int[b] > 0) {
                result.push_back(b);
                map_int_int[b]--;
            }
        }
        return result;
    }
};

相关问题

(E) Intersection of Two Arrays

题目来源