concise solution
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 p = 0;
        int[] answer = new int[2], temp1, temp2;
        answer[0] = 0; answer[1] = 0;

        while(p < 2) {
            temp1 = nums1; temp2 = nums2;
            if(p != 0) { 
                temp1 = nums2;
                temp2 = nums1;
            }
            for(int i = 0 ; i < temp1.length; i++) {
                for(int j = 0; j < temp2.length; j++) {
                    if(temp1[i] == temp2[j]){
                        answer[p]++;
                        break;
                    }
                }
            }
            p++;
        }
        return answer;
    }
}
```
['Java']