Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays. You may return the result in any order.
Example 1:
Input: nums1 = [1, 2, 2, 1], nums2 = [2, 2]
Output: [2, 2]
Explanation: The element 2 appears twice in both arrays, so it appears twice in the result.
Example 2:
Input: nums1 = [4, 9, 5], nums2 = [9, 4, 9, 8, 4]
Output: [4, 9]
Explanation: 4 and 9 each appear at least once in both arrays. The order of the result does not matter, so [9, 4] is also accepted.
1 <= nums1.length, nums2.length <= 10000 <= nums1[i], nums2[i] <= 1000