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

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.