一種方法是使用doesObjectHaveNestedKey()如下所示的遞歸搜索函數(shù)（這不需要像 lodash 這樣的額外依賴項）：
const object = {
some : {
nested : {
property : {
to : [
{
find : {
foo : [ 1 , 2 , 3 ]
}
}
]
}
}
}
}
/* Define function to recursively search for existence of key in obj */
function doesObjectHaveNestedKey(obj, key) {
if(obj === null || obj === undefined) {
return false;
}
for(const k of Object.keys(obj)) {
if(k === key) {
/* Search keys of obj for match and return true if match found */
return true
}
else {
const val = obj[k];
/* If k not a match, try to search it's value. We can search through
object value types, seeing they are capable of containing
objects with keys that might be a match */
if(typeof val === 'object') {
/* Recursivly search for nested key match in nested val */
if(doesObjectHaveNestedKey(val, key) === true) {
return true;
}
}
}
}
return false;
}
console.log('has foo?', doesObjectHaveNestedKey(object, 'foo') ) // True
console.log('has bar?', doesObjectHaveNestedKey(object, 'bar') ) // False
console.log('has nested?', doesObjectHaveNestedKey(object, 'nested') ) // True
console.log('has cat?', doesObjectHaveNestedKey(null, 'cat') ) // False
這里的想法是：
查看輸入對象“obj”的鍵，尋找與輸入“key”匹配的鍵“k”
如果找到匹配項，則返回 true，否則
尋找能夠存儲嵌套對象的“obj”的任何值“val”（探索“Object”類型，因為只有這些可以存儲嵌套鍵）和
遞歸搜索這些類型的“val”以進行匹配，如果找到，則返回 true
