LeetCode350 Intersection of Two Arrays II

题目：

       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?

import java.util.*;

public class IntersectionTwoArrays {
    public static int[] intersection(int[] nums1, int[] nums2) {
        if (nums1 == null || nums2 == null || nums1.length == 0 || nums2.length == 0)
            return new int[0];
        Map<Integer, Integer> map = new HashMap<>();
        List<Integer> list = new ArrayList<>();

        for (int i = 0; i < nums1.length; i++){
            if (map.get(nums1[i])==null){
                map.put(nums1[i], 1);
            }else {
                map.put(nums1[i], map.get(nums1[i]) + 1);
            }
        }

        for (int num : nums2) {
            if (map.containsKey(num)&&map.get(num) > 0) {
                list.add(num);
                map.put(num, map.get(num) - 1);
            }
        }

        int[] result = new int[list.size()];
        int i=0;
        for (Integer val :  list) {
            result[i++] = val;
        }
        return result;
    }

    public static void main(String[] args) {
        int[] nums1 = {4,9,5};
        int[] nums2 = {9,4,9,8,4};
        System.out.println(Arrays.toString(intersection(nums1, nums2)));
    }
}

 LeetCode上不采用查找表，直接排序两个数组并利用两个索引解决此问题，只用遍历一遍数组，这个方法耗时1ms，而查找表首先需要遍历一遍数组建立查找表，耗时有3ms。

import java.util.*;

public class IntersectionTwoArrays {
    public static int[] intersection(int[] nums1, int[] nums2) {
        if (nums1 == null || nums2 == null || nums1.length == 0 || nums2.length == 0)
            return new int[0];

        Arrays.sort(nums1);
        Arrays.sort(nums2);

        int i = 0;
        int j = 0;
        int index = 0;
        int[] result = new int[Math.min(nums1.length, nums2.length)];

        while (i < nums1.length && j < nums2.length) {
            if (nums1[i] == nums2[j]) {
                result[index ++] = nums1[i];
                i ++;
                j ++;
            } else if (nums1[i] < nums2[j]) {
                i ++;
            } else {
                j ++;
            }
        }

        return Arrays.copyOf(result, index);
    }

    public static void main(String[] args) {
        int[] nums1 = {4,9,5};
        int[] nums2 = {9,4,9,8,4};
        System.out.println(Arrays.toString(intersection(nums1, nums2)));
    }
}