java solution beats 80%( easy to understand)
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        int answer1=0;\n        for(int i=0;i<nums1.length;i++){\n            for(int j=0;j<nums2.length;j++){\n                if(nums1[i]==nums2[j]){\n                    answer1++;\n                    break;\n                }\n            }\n        }\n        int answer2=0;\n        for(int j=0;j<nums2.length;j++){\n            for(int i=0;i<nums1.length;i++){\n                if(nums2[j]==nums1[i]){\n                    answer2++;\n                    break;\n                }\n            }\n        }\n        return new int[]{answer1,answer2};\n        \n    }\n}\n```
['Java']