这是一个基于的交集函数Array.prototype.filter https://developer.mozilla.org/en/docs/JavaScript/Reference/Global_Objects/Array/filter
function intersect(a, b) {
var t;
if (b.length > a.length) t = b, b = a, a = t; // indexOf to loop over shorter
return a.filter(function (e) {
return b.indexOf(e) > -1;
});
}
var arr1 = ["mike", "sue", "tom", "kathy", "henry"];
arr2 = ["howey", "jim", "sue", "jennifer", "kathy", "hank", "alex"];
intersect(arr1, arr2); // ["sue", "kathy"]
您可能还需要考虑以下事项
var arr1 = ['sue', 'sue', 'kathy'],
arr2 = ['kathy', 'kathy', 'sue'];
上面现在给出["sue", "sue", "kathy"]
。如果您不想重复,您可以对此进行进一步的过滤。这也将使结果标准化。 IE。
return a
.filter(/* .. */) // same as before
.filter(function (e, i, c) { // extra step to remove duplicates
return c.indexOf(e) === i;
});
添加它现在将返回与之前的数组相同的结果(["sue", "kathy"]
),即使有重复项。