数组转children

方法

const result = tocNodes.reduce((acc, curr) => {
if (curr.level === 1) {
acc.push({
text: curr.text,
level: curr.level
});
} else {
let parent = acc[acc.length - 1];
for (let i = 1; i < curr.level - 1; i++) {
parent = parent.children[0];
}
if (!parent.children) {
parent.children = [];
}
parent.children.push({
text: curr.text,
level: curr.level
});
}
return acc;
}, []);

数据
const arr = [{
name: 'a',
level: 1
}, {
name: 'b',
level: 2
}, {
name: 'b2',
level: 3
}, {
name: 'b22',
level: 4
}, {
name: 'c',
level: 1
}, {
name: 'd',
level: 2
}];


转children
[{
"name": "a",
"level": 1,
"children": [{
"name": "b",
"level": 2,
"children": [{
"name": "b2",
"level": 3,
"children": [{
"name": "b22",
"level": 4
}]
}]
}]
}, {
"name": "c",
"level": 1,
"children": [{
"name": "d",
"level": 2
}]
}]




方法二

loadTreeData(data, pid, text, cid, root) {

  let tree = [];
  data.forEach(e => {
    if (root === e[pid]) {
      e['label'] = e[text];
      e['id'] = e[cid]
      e['children'] = this.loadTreeData(data, pid, text, cid, e[cid]);
      tree.push(e);
    }
  });
  return tree;
},
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值