场景
有一个树形节点数据,想要根据关键词查找子节点,得到一个过滤后的新树形数据。
树形数据
let treeData = [
{
id: '1',
name: '张三',
children: [
{
id: '1.1',
name: '李四',
children: [
{
id: '1.1.1',
name: '黄五',
children: []
},
{
id: '1.1.2',
name: '老六',
children: []
},
]
},
{
id: '1.2',
name: '孙七',
children: []
},
]
},
{
id: '2',
name: '王八',
children: [
{
id: '2.1',
name: '赵九',
children: [
{
id: '',
name: '刘十',
children: []
},
{
id: '2.1.2',
name: 'III',
children: []
},
]
},
{
id: '2.2',
name: '渔船',
children: []
},
{
id: '2.3',
name: '渔船轨迹',
children: []
},
{
id: '2.4',
name: 'LLL',
children: []
},
]
}
]
递归函数
function deepFilter(array, value) {
return array.filter(function (item) {
let result = false;
if (item.children && item.children.length > 0) {
item.children = deepFilter(item.children, value);
result = item.children && item.children.length > 0;
} else {
result = item.name.includes(value);
}
return result;
});
}
调用
let newArr = deepFilter(treeData, '渔船');
// 格式化打印看看效果
console.log(JSON.stringify(newArr, null, 4));