search

king-lxt / LeetCode-javasctipt

leetCode 答案
0 stars 0 forks source link

两个数组的交集 #5

Open king-lxt opened 3 years ago

king-lxt commented 3 years ago 
示例 1：

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


示例 2:

输入：nums1 = [4,9,5], nums2 = [9,4,9,8,4]
输出：[4,9]
king-lxt commented 3 years ago 
var intersect = function(nums1, nums2) {
    let ans = [], hash ={};
    for(i of nums1){
        hash[i]?++hash[i]:hash[i] =1 ;
    }
    for(j of nums2) {
        if(hash[j]) {
            ans.push(j);
            --hash[j]
        }
    }
    return ans;
};