leetcode 349 Intersection of Two Arrays || leetcode 350 Intersection of Two Arrays II

leetcode 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.

题目地址:leetcode Intersection of Two Arrays

题意:给定两个数组,求他们的交集(不算重复)

思路:太TM水了,直接上哈希表即可。。。

Python

 

当然也可以one line

C++

Java

 

 


 

leetcode 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?

题目地址:Intersection of Two Arrays II

题意:给定两个数组,求他们的交集(可以重复)

思路:用个字典。。。计数即可。

 

 

 

本题是leetcode 349 Intersection of Two Arrays  和 leetcode 350 Intersection of Two Arrays II题解

更多题解可以查看:https://www.hrwhisper.me/leetcode-algorithm-solution/

本博客若无特殊说明则由 hrwhisper 原创发布
转载请点名出处:细语呢喃 > leetcode 349 Intersection of Two Arrays || leetcode 350 Intersection of Two Arrays II
本文地址:https://www.hrwhisper.me/leetcode-intersection-two-arrays/

听说长得好看的已经打赏了

Leetcode , , . permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *