Given two integer arrays *nums1* and *nums2*, return *an array of their intersection*. Each element in the result should appear as many times as it shows in both arrays (i.e., the **multiset intersection**). You may return the result in any order.
nums1 = [list of integers], nums2 = [list of integers]
int[] (elements common to both, with multiplicity, any order)
Example 1:
Input:
nums1 = [1,2,2,1] nums2 = [2,2]
Output:
[2,2]
Example 2:
Input:
nums1 = [4,9,5] nums2 = [9,4,9,8,4]
Output:
[4,9]
Example 3:
Input:
nums1 = [1,2] nums2 = [1,1]
Output:
[1]
Example 4:
Input:
nums1 = [1] nums2 = [1]
Output:
[1]