leetcode 350. Intersection of Two Arrays II

原创 2016年05月31日 09:56:47

题目内容
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;
    }
}

leetcode350~Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2...

【Leetcode】350. Intersection of Two Arrays II

方法一: 思路: 用flag标记是否nums2中的该元素已经是相交的元素,若不是才加入结果list,并置flag为1然后跳出内层循环继续判断nums1的下一个元素。 public class Solu...

<LeetCode OJ> 349 / 350 Intersection of Two Arrays(I / II)

Total Accepted: 3212 Total Submissions: 6814 Difficulty: Easy Given two arrays, write a functio...

[leetcode] 350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, ...

[LeetCode] 350. Intersection of Two Arrays II

[LeetCode] 350. Intersection of Two Arrays II 解题思路
  • zhao_tw
  • zhao_tw
  • 2016年10月20日 19:52
  • 101

Leetcode——350. Intersection of Two Arrays II

题目Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2,...

350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, ...

leetcode解题之349 & 350. Intersection of Two Arrays Java版(求数组交集))

350. Intersection of Two Arrays II leetcode解题之349. Intersection of Two Arrays & 350. Intersection ...

350.[LeetCode]Intersection of Two Arrays

算法效率分析如下:// m n // 如果我用二分排序,那么时间就是 (nlogn + mlogm + m + n) // 但是用java的哈希表的话,时间可以缩短到 O(m+n),因为哈希表的插入时...

LeetCode-349&350.Intersection of Two Arrays

https://leetcode.com/problems/intersection-of-two-arrays/ Given two arrays, write a function to co...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 350. Intersection of Two Arrays II
举报原因:
原因补充:

(最多只允许输入30个字)