simple basic code
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 
\n\n# Complexity\n- Time complexity:O(n+m)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n+m)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        Set<Integer> set1 = new HashSet<>();\n        Set<Integer> set2 = new HashSet<>();\n        for (int num : nums1) {\n            set1.add(num);\n        }\n        int s = 0;\n        for (int num : nums2) {\n            if (set1.contains(num)) {\n                s++;\n                set2.add(num);\n            }\n        }\n        \n        int v = 0;\n        for (int num : nums1) {\n            if (set2.contains(num)) {\n                v++;\n            }\n        }\n\n       \n        int[] result = new int[2];\n        result[0] = v;\n        result[1] = s;\n        return result;\n        \n    }\n}\n```
['Java']