solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.cpp at main

main

leetcode-ion

388 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.cpp

5 Complexity
5 Complexity / M
0 Duplication
1 Churn
18 Lines
18 Lines of Code
1 Methods
18 LOC / Method

class Solution {
public:
    vector<int> intersection(vector<vector<int>>& nums) {
        int cnt[1001]{};
        for (auto& arr : nums) {
            for (int& x : arr) {
                ++cnt[x];
            }
        }
        vector<int> ans;
        for (int x = 0; x < 1001; ++x) {
            if (cnt[x] == nums.size()) {
                ans.push_back(x);
            }
        }
        return ans;
    }
};