
对象搜索算法挑战
方法一:
function where(collection, source) {
var arr = [];
var keys = Object.keys(source);
arr = collection.filter(function(val){
for (var i = 0;i < keys.length;i++){
if(!val.hasOwnProperty(keys[i]) || val[keys[i]] !== source[keys[i]]){
return false;
}
}
return true;
});
// What's in a name?
return arr;
}
where([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" });
方法二:
function where(collection, source) {
// What's in a name?
var arr = [],
keys = Object.keys(source),
kLen = keys.length;
// Only change code below this line
collection.forEach(function(obj){
var match = true;
for(var i=0;i<kLen;i++){
if(!obj.hasOwnProperty(keys[i])){
match = false;
break;
}else{
if(source[keys[i]] != obj[keys[i]]){
match = false;
break;
}
}
}
if(match){
arr.push(obj);
}
});
// Only change code above this line
return arr;
}
where([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" });