树形数据扁平化&数组数据树形化

数据扁平化:        

let objArr = [
  {
    id: 1,
    name: '部门1',
    children: [
      {
        id: 2,
        name: '部门2',

        children: []
      },
      {
        id: 3,
        name: '部门3',
        children: [
          {
            id: 4,
            name: '部门4',
            children: [
              {
                id: 5,
                name: '部门5',
                children: []
              }
            ]
          }
        ]
      }
    ]
  }
]
let result = []
const flattenArr = (arr, curArr, pid) => {
  let tempArr = arr.reduce((pre, cur) => {
    pre.push({
      id: cur?.id,
      name: cur?.name,
      pid: pid
    })
    cur.children?.length &&
      arr.forEach((i) => {
        flattenArr(i.children, curArr, i.id)
      })
    return pre
  }, [])
  curArr.push(...tempArr)
}
flattenArr(objArr, result, 0)
console.log(result)
//结果
[
  { id: 5, name: '部门5', pid: 4 },
  { id: 4, name: '部门4', pid: 3 },
  { id: 2, name: '部门2', pid: 1 },
  { id: 3, name: '部门3', pid: 1 },
  { id: 1, name: '部门1', pid: 0 }
]

数组数据树形化:

let arr = [
  { id: 5, name: '部门5', pid: 4 },
  { id: 4, name: '部门4', pid: 3 },
  { id: 2, name: '部门2', pid: 1 },
  { id: 3, name: '部门3', pid: 1 },
  { id: 1, name: '部门1', pid: 0 }
]
const arrToTree = (arr, pid) => {
  let result = []
  handleArr(arr, result, pid)
  return result
}
const handleArr = (arr, result, pid) => {
  for (const item of arr) {
    if (item.pid == pid) {
      let newObj = { ...item, children: [] }
      result.push(newObj)
      handleArr(arr, newObj.children, item.id)
    }
  }
}

console.log(JSON.stringify(arrToTree(arr, 0)))
//结果
   [
    {
        "id": 1,
        "name": "部门1",
        "pid": 0,
        "children": [
            {
                "id": 2,
                "name": "部门2",
                "pid": 1,
                "children": []
            },
            {
                "id": 3,
                "name": "部门3",
                "pid": 1,
                "children": [
                    {
                        "id": 4,
                        "name": "部门4",
                        "pid": 3,
                        "children": [
                            {
                                "id": 5,
                                "name": "部门5",
                                "pid": 4,
                                "children": []
                            }
                        ]
                    }
                ]
            }
        ]
    }
]

        

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值