C++, Beats  98.18% , O(n) ,Simple
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(n)\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {\n        vector<int>v1(101,0);\n        vector<int>v2(101,0);\n        int ans1=0,ans2=0;\n        for(auto it:nums1)\n            v1[it]++;\n        for(auto it:nums2)\n            v2[it]++;\n        for(int i=0;i<101;i++){\n            if(v1[i]){\n                if(v2[i])\n                    ans1+=v1[i];\n            }\n        }\n        for(int i=0;i<101;i++){\n            if(v2[i]){\n                if(v1[i])\n                    ans2+=v2[i];\n            }\n        }\n        return {ans1,ans2};\n    }\n};\n```
['Array', 'Hash Table', 'C++']