LeetCode 350. Intersection of Two Arrays II

350. Intersection of Two Arrays II

Easy

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]
Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]
Note:

Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.
Follow up:

What if the given array is already sorted? How would you optimize your algorithm?
What if nums1’s size is small compared to nums2’s size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

题意

给定两个数组，求数组的交集，如果交集中的元素在两个数组中均多次出现，则取出现次数的较小值放入交集数组

思路

【方法一】
将两个数组转化为HashMap，key为元素，value为元素出现的次数，合并两个HashMap，value取较小者
时间复杂度O(n), 但常数较大，
【方法二】
将数组排序之后用两个指针移动比较每个元素
时间复杂度O(nlogn)，但常数较小，实际上比方法一快

代码

【方法一：HashMap方法】

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        HashMap<Integer, Integer> cnt1 = new HashMap<>(), cnt2 = new HashMap<Integer, Integer>();
        for (int num: nums1) {
            if (cnt1.containsKey(num)) {
                cnt1.put(num, cnt1.get(num) + 1);
            } else {
                cnt1.put(num, 1);
            }
        }
        for (int num: nums2) {
            if (cnt2.containsKey(num)) {
                cnt2.put(num, cnt2.get(num) + 1);
            } else {
                cnt2.put(num, 1);
            }
        }
        ArrayList<Integer> ans = new ArrayList<Integer>();
        int cnt = 0, i = 0;
        for (Map.Entry<Integer, Integer> item: cnt1.entrySet()) {
            if (cnt2.containsKey(item.getKey())) {
                cnt = Math.min(item.getValue(), cnt2.get(item.getKey()));
                for (i=0; i<cnt; ++i) {
                    ans.add(item.getKey());
                }
            }
        }
        int n = ans.size();
        int[] ret = new int[n];
        for (i=0; i<n; ++i) {
            ret[i] = ans.get(i);
        }
        return ret;
    }
}

【方法二：sort方法】

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        Arrays.sort(nums1);
        Arrays.sort(nums2);
        int i = 0, j = 0, n1 = nums1.length, n2 = nums2.length;
        ArrayList<Integer> ans = new ArrayList<Integer>();
        while (i < n1 && j < n2) {
            if (nums1[i] == nums2[j]) {
                ans.add(nums1[i]);
                ++i;
                ++j;
            } else if (nums1[i] < nums2[j]) {
                ++i;
            } else {
                ++j;
            }
        }
        int n = ans.size();
        int[] ret = new int[n];
        for (i=0; i<n; ++i) {
            ret[i] = ans.get(i);
        }
        return ret;
    }
}