Easy and Understandable JAVA solution |HASHTABLE APPROACH| beats 56%
\n\n# Code\n\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        int ans1 = 0;\n        int ans2 = 0;\n        for (
\n\n# Code\n```\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        int ans1 = 0;\n        int ans2 = 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                    ans1++;\n                    break;\n                }\n            }\n        }\n        for (int i = 0; i < nums2.length; i++) {\n            for (int j = 0; j < nums1.length; j++) {\n                if (nums2[i] == nums1[j]) {\n                    ans2++;\n                    break;\n                }\n            }\n        }\n        return new int[] {ans1, ans2};\n    }\n}\n```
['Array', 'Hash Table', 'Java']