用递归将平行数据结构转换成树形数据结构(无id情况下)

black方块cxy

已于 2024-01-16 16:46:50 修改

阅读量884

点赞数 1

分类专栏：树形结构递归

于 2022-04-16 21:11:45 首次发布

本文链接：https://blog.youkuaiyun.com/qq_41920758/article/details/124220459

版权

数据转换递归树形结构学生信息属性分组

关键词由优快云通过智能技术生成

树形结构同时被 2 个专栏收录

1 篇文章

订阅专栏

递归

1 篇文章

订阅专栏

该博客介绍了如何将一个包含学生信息的列表转换为树形结构，以便于组织和展示。通过递归函数`data2TreeDigui`，根据指定的属性条件（如学院、年级、班级）对数据进行分组，最终生成了层次清晰的树形结构。这种方法对于处理层级数据非常有效。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1,测试数据 转换前
 let list = [
        {
          college: "梦想的学院",
          grade: "一年级",
          clazz: "1班",
        },
        {
          college: "嗷嗷叫学院",
          grade: "二年级",
          clazz: "1班",
          id: "xxx",
        },
        {
          college: "嗷嗷叫学院",
          grade: "一年级",
          clazz: "1班",
          id: "biubiubiu",
        },
        {
          college: "慢羊羊村大学",
          grade: "一年级",
          clazz: "1班",
        },
        {
          college: "梦想的学院",
          grade: "二年级",
          clazz: "1班",
        },
        {
          college: "慢羊羊村大学",
          grade: "一年级",
          clazz: "1班",
        },
      ];

2，转换后的树形结构
    [
        {
          title: "梦想的学院",
          children: [
            {
              title: "一年级",
              children: [
                {
                  title: "1班",
                  children: [
                    { college: "梦想的学院", grade: "一年级", clazz: "1班" },
                  ],
                },
              ],
            },
            {
              title: "二年级",
              children: [
                {
                  title: "1班",
                  children: [
                    { college: "梦想的学院", grade: "二年级", clazz: "1班" },
                  ],
                },
              ],
            },
          ],
        },
        {
          title: "嗷嗷叫学院",
          children: [
            {
              title: "二年级",
              children: [
                {
                  title: "1班",
                  children: [
                    {
                      college: "嗷嗷叫学院",
                      grade: "二年级",
                      clazz: "1班",
                      id: "xxx",
                    },
                  ],
                },
              ],
            },
            {
              title: "一年级",
              children: [
                {
                  title: "1班",
                  children: [
                    {
                      college: "嗷嗷叫学院",
                      grade: "一年级",
                      clazz: "1班",
                      id: "biubiubiu",
                    },
                  ],
                },
              ],
            },
          ],
        },
        {
          title: "慢羊羊村大学",
          children: [
            {
              title: "一年级",
              children: [
                {
                  title: "1班",
                  children: [
                    { college: "慢羊羊村大学", grade: "一年级", clazz: "1班" },
                    { college: "慢羊羊村大学", grade: "一年级", clazz: "1班" },
                  ],
                },
              ],
            },
          ],
        },
      ];


3、使用递归实现
递归实现的代码
      //   形成条件
      const winCondition = ["college", "grade", "clazz"];
      //   函数
      function data2TreeDigui(list, condition) {
        const newArr = [];
        condition = JSON.parse(JSON.stringify(condition));
        let order = condition.shift();
        let holdArr = [];
        const deep = condition.length;
        list.forEach((item, index) => {
          const holdIndex = holdArr.indexOf(item[order]);
          if (holdIndex > -1) {
            newArr[holdIndex]["children"].push(item);
            newArr[holdIndex]["title"] = item[order];
          } else {
            holdArr.push(item[order]);
            newArr.push({
              title: item[order],
              children: new Array(item),
            });
          }
        });
        newArr.forEach((item, index) => {
          if (item.children.length > 0 && deep) {
            //   给children赋值 递归
            item.children = data2TreeDigui(item.children, condition);
          }
        });
        return newArr;
      }
      //   结果
      const treeData = data2TreeDigui(list, winCondition);
      console.log("treeData: ", JSON.stringify(treeData));