- 如果單擊的所有子項都為真,我需要將 clicked 屬性更改為父項的 true。所以在這種情況下,ID - 14,15 的 clicked 屬性為 true。因此,必須將點擊 ID 11 的父母設為真實。
- 如果 11,12,14,15 為真,則必須使 4 為真。
let obj = {children:[
{
ID:1,
clicked: false,
children: [
{
ID:4,
clicked: false,
children: [
{
ID:11,
clicked: false,
children: [
{
ID:14,
clicked: true,
},
{
ID:15,
clicked: true,
}
]
},
{
ID:12,
clicked: false,
}
]
},
{
ID:5,
clicked: false,
}
]
}
]
}
uj5u.com熱心網友回復:
您可以采用深度優先搜索演算法,如果所有子級都包含clicked: true,則父級會獲得更新。
const
update = object => {
if (!object.children) return object.clicked;
return object.clicked = object.children.every(update);
},
object = { children: [{ ID: 1, clicked: false, children: [{ ID: 4, clicked: false, children: [{ ID: 11, clicked: false, children: [{ ID: 14, clicked: true }, { ID: 15, clicked: true }] }, { ID: 12, clicked: false }] }, { ID: 5, clicked: false }] }] };
update(object);
console.log(object);
.as-console-wrapper { max-height: 100% !important; top: 0; }
uj5u.com熱心網友回復:
當您想要改變輸入時,Nina 給出了一個很好的答案。
這是一個創建新物件的簡單方法:
const consolidate = ({clicked, children = [], ...rest}, _, __, kids = children .map (consolidate)) => ({
...rest,
clicked: clicked || (kids .length > 0) && kids .every (k => k .clicked),
...(kids .length ? {children: kids} : {})
})
const obj1 = {children: [{ID: 1, clicked: false, children: [{ID: 4, clicked: false, children: [{ID: 11, clicked: false, children: [{ID: 14, clicked: true}, {ID: 15, clicked: true}]}, {ID: 12, clicked: false}]}, {ID: 5, clicked: false}]}]};
// with 12 switched to `true`
const obj2 = {children: [{ID: 1, clicked: false, children: [{ID: 4, clicked: false, children: [{ID: 11, clicked: false, children: [{ID: 14, clicked: true}, {ID: 15, clicked: true}]}, {ID: 12, clicked: true}]}, {ID: 5, clicked: false}]}]};
console .log ('obj1', consolidate (obj1))
console .log ('obj2', consolidate (obj2))
.as-console-wrapper {max-height: 100% !important; top: 0}
如果有的話,我們在 上遞回children,然后重新生成評估clicked每個屬性的物件。
轉載請註明出處,本文鏈接:https://www.uj5u.com/net/437292.html
標籤:javascript 算法 树 深度优先搜索 广度优先搜索
上一篇:如何根據Python中的2個運算子串列在串列中添加或減去3個專案?
下一篇:查找陣列的連續元素之間的最大差異
