【LeetCode】 350. Intersection of Two Arrays II

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:

• 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?

public class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        Map<Integer, Integer> map1 = new HashMap<Integer, Integer>();
        List<Integer> list = new LinkedList<Integer>();
        for (int i : nums1) {
            Integer temp = map1.get(i);
            if (temp == null) {
                map1.put(i, 1);
            } else {
                map1.put(i, temp + 1);
            }
        }
        for (int i : nums2) {
            if (map1.containsKey(i) && map1.get(i) > 0) {
                list.add(i);
                map1.put(i, map1.get(i) - 1);
            }
        }
        int[] res = new int[list.size()];
        int i = 0;
        for (int num : list) {
            res[i++] = num;
        }
        return res;
    }
}