simple and easy C++ solution 😍❤️‍🔥
if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n# Code\n\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& v1, vector<int>
# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& v1, vector<int>& v2) \n    {\n        unordered_map<int,int>mp1, mp2;\n        for(int v:v1) mp1[v]++;\n        for(int v:v2) mp2[v]++;\n\n        int a = 0, b = 0;\n        for(auto val:v1) \n            if(mp2[val]) a++;\n        for(auto val:v2)\n            if(mp1[val]) b++;\n        return {a, b};\n    }\n};\n```
['Array', 'Hash Table', 'C++']