当前位置：网站首页>＃yyds干货盘点＃JS数组和树相互转化

＃yyds干货盘点＃JS数组和树相互转化

2022-08-05 10:58:00 【51CTO】

1、树形数据转数组

       
       const recursion = (arr, num) => {
       
  arr.forEach((ele) => {
       
    // 判断有子元素,并且子元素的长度大于0就再次调用自身
       
    if (ele.children && ele.children.length > 0) {
       
      // var node_root = ele.children.filter((item) => item.basicData == 3);
       
      for (let k = 0; k < ele.children.length; k++) {
       
        if (ele.children[k].basicData == 3) {
       
          data.rootAllNode.push({
       
            nodeId: ele.children[k].id,
       
            context: ele.children[k].title,
       
            parentId: ele.children[k].parentId,
       
            basicData: ele.children[k].basicData,
       
            checkArr: "1",
       
            checked: "1",
       
            disabled: true,
       
          });
       
        } else if (ele.children[k].basicData == 2) {
       
          data.parentAllNode.push({
       
            nodeId: ele.children[k].id,
       
            context: ele.children[k].title,
       
            parentId: 1,
       
            basicData: ele.children[k].basicData,
       
            checkArr: "1",
       
            checked: "1",
       
            disabled: true,
       
          });
       
        }
       
      }
       
      recursion(ele.children, num);
       
    }
       
  });
       
};
      
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.

2、数组转树形数据

       
       const toTree = (data) => {
       
  let result = [];
       
  if (!Array.isArray(data)) {
       
    return result;
       
  }
       
  data.forEach((item) => {
       
    delete item.children;
       
  });
       
  let map = {};
       
  data.forEach((item) => {
       
    map[item.nodeId] = item;
       
  });
       
  data.forEach((item) => {
       
    let parent = map[item.parentId];
       
    if (parent) {
       
      (parent.children || (parent.children = [])).push(item);
       
    } else {
       
      result.push(item);
       
    }
       
  });
       
  return result;
       
};
      
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.

原网站

版权声明
本文为[51CTO]所创，转载请带上原文链接，感谢
https://blog.51cto.com/u_11365839/5545431

当前位置：网站首页>＃yyds干货盘点＃JS数组和树相互转化

＃yyds干货盘点＃JS数组和树相互转化

边栏推荐

猜你喜欢

随机推荐