[Java] Simple 100% solution
java\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        final boolean[] l1 = new boolean[101];\n        final boole
```java\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        final boolean[] l1 = new boolean[101];\n        final boolean[] l2 = new boolean[101];\n\n        for(final int num : nums1)\n            l1[num] = true;\n\n        for(final int num : nums2)\n            l2[num] = true;\n\n        int first = 0, second = 0;\n\n        for(final int num : nums1)\n            if(l2[num])\n                ++first;\n\n        for(final int num : nums2)\n            if(l1[num])\n                ++second;\n\n        return new int[] { first, second };\n    }\n}\n```
['Java']