Given two integer arrays nums1 and nums2, return an array representing their intersection. Each element in the result should appear exactly as many times as it appears in both arrays. The result may be returned in any order.
Constraints:
1≤ nums1.length, nums2.length ≤1000
0≤ nums1[i], nums2[i] ...