Description
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.
Examples
Input:
nums1 = [1,2,2,1], nums2 = [2,2]Output:
[2]Explanation:
Converting both arrays to sets, nums1 has {1, 2} and nums2 has {2}. The only common element is 2, so the intersection is [2].
Input:
nums1 = [4,9,5], nums2 = [9,4,9,8,4]Output:
[4,9]Explanation:
Set of nums1 is {4, 5, 9} and set of nums2 is {4, 8, 9}. Elements 4 and 9 appear in both, so they form the intersection.
Input:
nums1 = [1,2,3], nums2 = [4,5,6]Output:
[]Explanation:
The two arrays share no common elements, so the intersection is empty.
Constraints
- •
1 ≤ nums1.length, nums2.length ≤ 1000 - •
0 ≤ nums1[i], nums2[i] ≤ 1000