349. Intersection of Two Arrays
Easy
Given two integer arrays
nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.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]
Explanation:
[4,9] is also accepted.
Constraints:
1 <= nums1.length, nums2.length <= 10000 <= nums1[i], nums2[i] <= 1000
Runtime: 3 ms, faster than 86.21%
Memory Usage: 2.9 MB, less than 88.97%
func intersection(nums1 []int, nums2 []int) []int {
arr1 := [1001]bool{false}
arr2 := [1001]bool{false}
for _, val := range(nums1) {
arr1[val] = true
}
for _, val := range(nums2) {
arr2[val] = true
}
ans := []int{}
for i:=0; i<1001; i++ {
if arr1[i]&&arr2[i] {
ans = append(ans, i)
}
}
return ans
}