const loop = (data, key, parent = []) => {
const haveChildren = Array.isArray(data.children) && data.children.length > 0;
data.keys = [...parent, key]
if (haveChildren)(data.children.forEach((item, index) => loop(item, index, data.keys)))
};
data.forEach((item,index) => loop(item,index))
console.log(data)
树结构的数据递归给每一层做深度index标记上下级关系
于 2023-02-24 17:44:13 首次发布