Intersection of Two Arrays II
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays, and you may return the result 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 tonums2's size? Which algorithm is better? - What if elements of
nums2are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
Example 1
Input
nums1 = [1,2,2,1], nums2 = [2,2]Output
[2,2]The value 2 appears twice in both arrays, so it appears twice in the intersection.
Example 2
Input
nums1 = [4,9,5], nums2 = [9,4,9,8,4]Output
[4,9]Both 4 and 9 appear in both arrays, and [9,4] is also accepted.
Constraints
- 1 <= nums1.length, nums2.length <= 1000
- 0 <= nums1[i], nums2[i] <= 1000