0350. Intersection of Two Arrays II.java

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        Arrays.sort(nums1);
        Arrays.sort(nums2);

        int n1 = nums1.length;
        int n2 = nums2.length;

        int i = 0, j = 0, k = 0;
        int[] temp = new int[Math.min(n1, n2)];

        while (i < n1 && j < n2) {
            if (nums1[i] == nums2[j]) {
                temp[k++] = nums1[i++];
                j++;
            } else if (nums1[i] < nums2[j]) {
                i++;
            } else {
                j++;
            }
        }

        int[] result = new int[k];
        for (int x = 0; x < k; x++) {
            result[x] = temp[x];
        }

        return result;
    }
}