number array.
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
```java []
class Solution {
    public int[] findIntersectionValues(int[] nums1, int[] nums2) {
        int[] dict = new int[101];
        Arrays.fill(dict, -1);
        int right = 0;
        int left = 0;

        for (int i = 0; i < nums1.length; ++i) {
            if (dict[nums1[i]] == -1) {
                dict[nums1[i]] = 0;
            }
            dict[nums1[i]] ++;
        }

        for (int i = 0; i < nums2.length; ++i) {
            if(dict[nums2[i]] != -1) {
                right ++;
                left += dict[nums2[i]];
                dict[nums2[i]] = 0;

            }
        }

        return new int[]{left, right};
    }
}
```
['Java']