js数组求交集

//交集
function intersect(arr1, arr2) {
    var res = [];
    for(var i = 0; i < arr1.length; i++){
      for(var j = 0; j < arr2.length; j++){
        if(arr1[i] == arr2[j]){
          res.push(arr1[i]);
          arr1.splice(i,1);
          arr2.splice(j,1);
          i--;
          j--;
        }
      }
    }
    return res;
};

//map
var intersection = function(nums1, nums2) {
    var res = [];
    var obj = {};
    for(var i = 0; i < nums1.length;i++){
        if(!obj[nums1[i]]) {
            obj[nums1[i]] = 1
        }
    }
    for(var j = 0; j < nums2.length;j++){
        if(obj[nums2[j]]){
            res.push(nums2[j]);
            obj[nums2[j]]--
        }
    }
    return res
};