350. 两个数组的交集 II(javascript)350. Intersection of Two Arrays II

leetcode题目：https://leetcode-cn.com/problems/intersection-of-two-arrays-ii/

给你两个整数数组 nums1 和 nums2 ，请你以数组形式返回两数组的交集。返回结果中每个元素出现的次数，应与元素在两个数组中都出现的次数一致（如果出现次数不一致，则考虑取较小值）。可以不考虑输出结果的顺序。

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 and you may return the result in any order.

示例 1：

输入：nums1 = [1,2,2,1], nums2 = [2,2]
输出：[2,2]

示例 2:

输入：nums1 = [4,9,5], nums2 = [9,4,9,8,4]
输出：[4,9]

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]
Explanation: [9,4] is also accepted.

var intersect = function (nums1, nums2) {
//提前将数组的长度进行获取
    let len1 = nums1.length
    let len2 = nums2.length
    //确保最先遍历的数组是最短的
    if (len1 > len2) {
        intersect(nums2, nums1)
    }
    //下面的操作是将nums1数组进行遍历，获取每项的次数
    let h = new Map()
    let newList = []
    for (let i = 0; i < len1; i++) {
        if (!h.has(nums1[i])) {
            h.set(nums1[i], 1)
        } else {
            h.set(nums1[i], h.get(nums1[i]) + 1)
        }
    }
    //下面的操作是将nums2在map中存在的项添加到新的数组，同时将次数减一
    for (let i = 0; i < len2; i++) {
        if (h.has(nums2[i]) && h.get(nums2[i]) > 0) {
            newList.push(nums2[i]);
            h.set(nums2[i], h.get(nums2[i]) - 1)
        }
    }
    return newList
};

var intersect = function (nums1, nums2) {
    let len1 = nums1.length
    let len2 = nums2.length
    if (len1 > len2) {
        intersect(nums2, nums1)
    }
    let h = new Map()
    let newList = []
    for (let i = 0; i < len1; i++) {
        h.set(nums1[i], (h.has(nums1[i]) ? h.get(nums1[i]) : 0) + 1)
        //h.set(nums1[i], !h.has(nums1[i])?1:h.get(nums1[i]) + 1)//此处将上面的代码进行优化
        
    }
    for (let i = 0; i < len2; i++) {
        if (h.has(nums2[i]) && h.get(nums2[i]) > 0) {
            newList.push(nums2[i]);
            h.set(nums2[i], h.get(nums2[i]) - 1)
        }
    }
    return newList

};