JS递归生成antd tree树形数据

Question

最近有个需求，需要使用antd里的table树形控件。后台返回的数据是这样的

每个对象里有一个id和parentId,parentId为0的是第一层数据，然后再w拿其它对象里的parentId对比它的id，如果相等就是第一层数据的子级，以此类推，拿parentId对比上一级id，去找下级以及下级的子级.
最后实现的效果应该这种：

let newArr = [
  {
    inputTypeId: 2,
    maintenanceId: 64,
    name: "室内设施",
    id: 100133,
    parentId: 0,
    children: [
      {
        inputTypeId: 2,
        maintenanceId: 64,
        name: "室内设施一",
        id: 10012,
        parentId: 100133,
      },
      {
        inputTypeId: 2,
        maintenanceId: 64,
        name: "室内设施二",
        id: 10011,
        parentId: 100133,
        children: [
          {
            inputTypeId: 2,
            maintenanceId: 64,
            name: "室内设施二",
            id: 3333,
            parentId: 10011,
          }
        ]
      }
    ]
  }
]

Answer 1

renderTreeData = (data,id = 0) => {
    let treeData = [];
    data.forEach(item => {
        if (item.parentId == id) {
            const { checkResult = '', remark = '', id } = item;
            let newItem = {};
            newItem = {
              ...item, 
              key: id,
              checkResult, 
              remark
            }
            newItem.children = this.renderTreeData(data, id);
            !newItem.children.length && delete newItem.children
            treeData.push(newItem);
        }
    })
    return treeData;
  }