easy approach
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {
    int m=nums1.size();
    int n=nums2.size();  
    vector<int>p;
    int c1=0;
    int c2=0; 
    for (int i=0; i<m; i++){
        for(int j=0; j<n; j++){
            if(nums1[i]==nums2[j]){
                c1++;
                break;
        }
    } 
    }
    for (int j=0; j<n; j++){
        for(int i=0; i<m; i++){
            if(nums2[j]==nums1[i]){
                c2++;
                break;
        }
    } 
    }
    p.push_back(c1);
    p.push_back(c2);
    return p;
    }
};
```
['C++']