?350. Intersection of Two Arrays II (Java)

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

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

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

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:

(1) What if the given array is already sorted? How would you optimize your algorithm?
(2) What if nums1's size is small compared to nums2's size? Which algorithm is better?
(3) 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?

// 三个问题未回答？？？
public class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        HashMap<Integer, Integer> map = new HashMap<>();
        ArrayList<Integer> res = new ArrayList<>();
        for (int i = 0; i < nums1.length; i ++) {
            if (map.containsKey(nums1[i])) map.put(nums1[i], map.get(nums1[i]) + 1);
            else map.put(nums1[i], 1);
        }
        for (int i = 0; i < nums2.length; i ++) {
            if (map.containsKey(nums2[i]) && map.get(nums2[i]) > 0) {
                res.add(nums2[i]);
                map.put(nums2[i], map.get(nums2[i]) - 1);
            }
        }
        int[] r = new int[res.size()];
        for (int i = 0; i < res.size(); i ++) {
           r[i] = res.get(i);
        }
        return r;
    }
}