leetcode

350. Intersection of Two Arrays II

Map solution code

_n = min( nums1 , nums2 )_
_m = max( nums1 , nums2 )_

Time complexity: O(n + m)

Space complexity: O(n)

Two pointers solution code

_n = nums1 _
_m = nums2 _

Time complexity: O(n log(n) + m log(m))

Space complexity: O(1)

Binary search solution code

_n = min( nums1 , nums2 )_
_m = max( nums1 , nums2 )_

Time complexity: O(n log(n) + m log(m) + n log(m))

Space complexity: O(1)