根据父子id将数组转换为树结构
// 创建分类树结构数据
const createTreeData = (data, childrenId, parentId) => {
const cloneData = JSON.parse(JSON.stringify(data)) // 对源数据深度克隆
const tree = cloneData.filter(father => {
//循环所有项
const branchArr = cloneData.filter(child => {
return father[childrenId] == child[parentId] //返回每一项的子级数组
})
if (branchArr.length > 0) {
father.children = branchArr //如果存在子级,则给父级添加一个children属性,并赋值
}
return father[parentId] == null //返回第一层
})
return tree
}
本文来自博客园,作者:懒惰ing,转载请注明原文链接:https://www.cnblogs.com/landuo629/p/15747858.html