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?
C!=0 ,like flag set to 1 by++, set to 0 by --
func intersect(nums1 []int, nums2 []int) []int {
nums1Map := make(map[int]int)
result := []int{}
for _,v :=range nums1{nums1Map[v]++}
for _,v :=range nums2{
c, ok := nums1Map[v]
if ok && c!=0 {
result = append(result, v)
nums1Map[v]--
}
}
return result
}