本文介绍了一种计算两个数组交集的算法，并讨论了不同情况下如何优化算法。例如当输入数组已排序或大小不同时的选择，还探讨了部分数据无法一次性加载到内存时的解决方案。
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?
提示：提交代码后，需要用简洁的语言解释一下代码思路~ 谢谢
历史题目和总结见公众号「每日一道算法题」
https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
思路：
扫一扫
695
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
