CN-350. Intersect of two arrays

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        if (nums1.length > nums2.length) {
            return intersect(nums2, nums1);
        }

        Map<Integer, Integer> numbers = new HashMap<>();
        for (int num: nums1) {
            numbers.put(num, numbers.getOrDefault(num, 0) + 1);
        }

        int[] res = new int[Math.min(nums1.length, nums2.length)];
        int r = 0;
        for (int i = 0; i < nums2.length; i++) {
            int num = nums2[i];
            if (numbers.getOrDefault(num, 0) != 0) {
                numbers.put(num, numbers.get(num) - 1);
                res[r++] = num;
            }
        }

        return Arrays.copyOfRange(res, 0, r);
    }
}