Leetcode 350 Intersection of Two Arrays II -Fb tag

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?

 

思路：

我觉得这三个follow up比题目有意思多了。

1. sorted的话，是不是双指针会比较强。

2. binary search is a better solution

3： 

1. Store the two strings in a distributed system(whether self-designed or not), then using MapReduce technique to solve the problem;

2. Processing the Strings by chunk, which fits the memory, then deal with each chunk of data at a time;

3. Processing the Strings by streaming, then check.

题目本身不难就是拿hashmap记住nums1[i]的次数就然后循环nums2[i]就行了。

代码如下：

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
          HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        ArrayList<Integer> result = new ArrayList<Integer>();
        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){
                result.add(nums2[i]);
                map.put(nums2[i], map.get(nums2[i])-1);
            }
        }
        int []r = new int[result.size()];
         for(int i=0;i<result.size();i++){
           r[i]=result.get(i);
         }
        return r;
}
}