leetcode刷题笔记(Golang)--349. Intersection of Two Arrays

349. Intersection of Two Arrays

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Note:

Each element in the result must be unique.
The result can be in any order.

func intersection(nums1 []int, nums2 []int) []int {
	d := map[int]int{}
	d2 := map[int]int{}
	res := []int{}
	for _, v := range nums1 {
		d[v]++
	}
	for _, v := range nums2 {
		if _, ok := d[v]; ok {
			d2[v]++
		}
	}
	for k := range d2 {
		res = append(res, k)
	}
	return res
}