先创建map求出两数组的交集,再用set对交集去重。
var intersection = function(nums1, nums2) {
let res = [];
let map = new Map();
let set = new Set();
nums1.forEach(item => map.set(item));
for(let i = 0; i < nums2.length; i++){
if(map.has(nums2[i])){
if(!set.has(nums2[i])){
set.add(nums2[i]);
res.push(nums2[i]);
}
}
}
return res;
};