[LeetCode]--350. Intersection of Two Arrays II

最新推荐文章于 2024-12-25 10:26:59 发布

杜鲁门

最新推荐文章于 2024-12-25 10:26:59 发布

阅读量690

点赞数

分类专栏： LeetCode LeetCode算法分析文章标签： leetcode 函数两数组交集算法算法

本文链接：https://blog.youkuaiyun.com/bug_moving/article/details/52834277

版权

LeetCode算法分析同时被 2 个专栏收录

115 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

126 篇文章

订阅专栏

给定两个数组，编写一个函数找出它们的交集。例如，输入nums1 = [1, 2, 2, 1], nums2 = [2, 2]，返回[2, 2]。注意，结果中的每个元素应与其在两个数组中出现的次数相同，结果顺序不限。当数组已排序或大小不同时，如何优化算法？在内存有限的情况下如何处理大数组？" 121140176,4857387,Java 在线考试系统模块设计,"['Java开发', '后端开发', '在线教育', '考试系统', 'API接口']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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?

其实跟一差不多，但是这个就是要注意短的数组不一定在后面，也可能nums1是短的那个数组。