[leetcode] 350. Intersection of Two Arrays II

原创 2016年05月31日 03:52:57

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.

Solution

Idea: hash table O(m + n) Space: O(m + n)
class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        vector<int> ret;
        unordered_map<int,int> h;
        for(int i=0; i<nums1.size();i++)
            ++h[nums1[i]];
        
        for(int j=0; j<nums2.size();j++){
            if(h[nums2[j]]>0){
                ret.push_back(nums2[j]);
                h[nums2[j]]--;
            }
        }
        return ret;
        
    }
};

Follow up 1: What if the given array is already sorted? How would you optimize your algorithm? 
Solution: O(max(m, n) log(max(m, n))) Space: O(m + n)
class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        vector<int> ret;
        sort(nums1.begin(), nums1.end());
        sort(nums2.begin(), nums2.end());
        int i = 0,j = 0;
        while (i<nums1.size() && j<nums2.size()){
            if (nums1[i]==nums2[j]){
                ret.push_back(nums1[i]);
                i++; 
                j++;
            }
            else if (nums1[i]>nums2[j]) j++;
            else i++;
        }
        return ret;
    }
};



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【Leetcode】350. Intersection of Two Arrays II

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

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

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 解题思路

<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, 2,...

350. Intersection of Two Arrays II

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

350. Intersection of Two Arrays II

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

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...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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