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 num2'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?

题目分析

通过hashmap 得到 nums1和nums2 中元素出现的个数，然后取交集，进行比较元素个数。讲交集元素添加到连表中，最后转化为数组即可。

public class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        Map<Integer,Integer> map1 =new HashMap<Integer,Integer>();
        Map<Integer,Integer> map2 =new HashMap<Integer,Integer>();

        List<Integer> ans1= new ArrayList<Integer>();

        for(int n : nums1) map1.put(n,map1.getOrDefault(n,0)+1);
        for(int n : nums2) map2.put(n,map2.getOrDefault(n,0)+1);

        for(int n : map2.keySet()){
            if(map1.containsKey(n)){
                int cc=0;
                if(map1.get(n)>map2.get(n)) cc=map2.get(n);
                else cc=map1.get(n);
                for(int i=0;i<cc;i++)
                    ans1.add(n);
            }
        }

        int[] re= new int[ans1.size()];
        for(int i=0;i<re.length;i++) re[i]=ans1.get(i);
        return re;
    }
}