二维数组转为树形结构
treeList1 = [
["a", "aa", "aaa", "aaaa"],
["b", "bb", "bbb"],
["a", "ab", "aba"],
["a", "aa", "aab"]
]
function toTree(arr) {
const obj = {
};
const res = [];
for (let i = 0; i < arr.length; i++) {
for (let j = 0; j < arr[i].length; j++) {
const item = arr[i][j];
if (!obj[item]) {
obj[item] = {
name: item,
child: [],
};
}
if (j > 0) {
const parent = obj[arr[i][j - 1]];
if (parent) {
if (parent.child.indexOf(obj[item]) < 0) {
paren

最低0.47元/天 解锁文章
889

被折叠的 条评论
为什么被折叠?



