js 树形结构问题处理?

Question

将如下结构中的type=1的内容提取到父级。层级可能是无限极。

const routes = [
  {
    name: "首页",
    type: 0,
    children: [],
  },
  {
    name: "系统管理",
    type: 0,
    children: [
      {
        name: "用户管理",
        type: 0,
        children: [
          {
            name: "新建用户",
            type: 1,
            children: [],
          },
        ],
      },
      {
        name: "角色管理",
        type: 0,
        children: [
          {
            name: "新建角色",
            type: 1,
            children: [],
          },
          {
            name: "成员管理",
            type: 1,
            children: [],
          },
        ],
      },
    ],
  },
];

期望：

const routes = [
  {
    name: "首页",
    type: 0,
    children: [],
  },
  {
    name: "系统管理",
    type: 0,
    children: [
      {
        name: "用户管理",
        type: 0,
        children: [],
      },
      {
        name: "新建用户",
        type: 1,
        children: [],
      },
      {
        name: "角色管理",
        type: 0,
        children: [],
      },
      {
        name: "新建角色",
        type: 1,
        children: [],
      },
      {
        name: "成员管理",
        type: 1,
        children: [],
      },
    ],
  },
];

Answer 1

大体上这样，细节在修改下

function flatArr(list){
    let pl = []
    let res = list.filter(item => {
        if(Array.isArray(item.children)){
            pl = pl.concat( flatArr(item.children) )
        }
        return item.type === 1
    })
    pl.length && list.push.apply(list, pl)
    return res
}