1.要求
2.思路
3.代码
function where(collection, source) {
var arr = [];
var arrj = Object.keys(source);
for(var i = 0; i<collection.length; i++){
var arri = Object.keys(collection[i]);
var mark = true;
for (var j = 0; j < arrj.length; j++){
if (arri.indexOf(arrj[j]) === -1 || collection[i][arrj[j]] !== source[arrj[j]]) {
mark =false;
}
}
if (mark){
arr.push(collection[i]);
}
}
// What‘s in a name?
return arr;
}
where([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" });
4.相关链接
Where art thou-freecodecamp算法题目
原文:https://www.cnblogs.com/ahswch/p/9298038.html