【leetcode】350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection.

Example:

Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

Your runtime beats 38.36% of javascriptsubmissions

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number[]}
 */
var intersect = function(nums1, nums2) {
    var l1 = nums1.length;
    var l2 = nums2.length;
    var res = [];
    for(var i=0; i<l1; i++){
        var n1 = nums1[i];
        for(var j=0;j<l2;j++){
            var n2 = nums2[j];
            if(n1 === n2){
                res = res.concat(nums2.splice(j,1));
                break;
            }
        }
    }
    return res;
};