Leetcode349. Intersection of Two Arrays

@小花

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

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

Note:

• Each element in the result must be unique.
• The result can be in any order

题目描述还比较清楚，就是找交集。第一种方法就是直接用JAVA的HashSet来实现相关的算法，实现的方法如下所示：

public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Set<Integer> set = new HashSet<>();
        Set<Integer> intersect = new HashSet<>();
        for (int i = 0; i < nums1.length; i++) {
            set.add(nums1[i]);
        }
        for (int i = 0; i < nums2.length; i++) {
            if (set.contains(nums2[i])) {
                intersect.add(nums2[i]);
            }
        }
        int[] result = new int[intersect.size()];
        int i = 0;
        for (Integer num : intersect) {
            result[i++] = num;
        }
        return result;
    }
}

其实这个代码已经比较简洁，使用两个HashSet的空间复杂度，但是这样的时间复杂度依旧是o(n)，并且借助了java内部的HashSet的数据结构。

下面再附一个使用二分查找实现的代码：

public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Set<Integer> set = new HashSet<>();
        Arrays.sort(nums2);
        for (Integer num : nums1) {
            if (binarySearch(nums2, num)) {
                set.add(num);
            }
        }
        int i = 0;
        int[] result = new int[set.size()];
        for (Integer num : set) {
            result[i++] = num;
        }
        return result;
    }
    
    public boolean binarySearch(int[] nums, int target) {
        int low = 0;
        int high = nums.length - 1;
        while (low <= high) {
            int mid = low + (high - low) / 2;
            if (nums[mid] == target) {
                return true;
            }
            if (nums[mid] > target) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        return false;
    }
}

其实个人认为这个非要使用二分查找有点牵强，或者说有些多余，其实也就是实现了容器内部的contains的功能，实现方法和上面一个代码没有什么大的区别。

接下来要说，如果题目变一下，考虑下面这个题目描述（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) {
        List<Integer> list = new ArrayList();
        Arrays.sort(nums1);
        Arrays.sort(nums2);
        for(int i=0,j=0;i< nums1.length&&j<nums2.length;)
        {
            if(nums1[i] < nums2[j])
                i++;
            else if(nums1[i] > nums2[j])
                j++;
            else{
                list.add(nums1[i]);
                i++;j++;
            }
        }
        int i = 0;  
        int[] result = new int[list.size()];  
        for (Integer num : list) {  
            result[i++] = num;  
        }  
        return result;
        
    }
    
}