对象数组数据转树结构

部门管理

后端返回数据结构

  1. [{…}, {…}, {…}, {…}, {…}, {…}, {…}, {…}]
    0: {bcode: "B001", cuicode: null, bname: "全公司", btype: null, pbcode: "B001", bpath: "B001", status: "70"}
    1: {bcode: "B002", cuicode: null, bname: "信息部", btype: null, pbcode: "B001", bpath: "B001.B002",…}
    2: {bcode: "B003", cuicode: null, bname: "客服部", btype: null, pbcode: "B001", bpath: "B001.B003",…}
    3: {bcode: "B004", cuicode: null, bname: "客服一部", btype: null, pbcode: "B003", bpath: "B001.B003.B004",…}
    4: {bcode: "B005", cuicode: null, bname: "客服二部", btype: null, pbcode: "B003", bpath: "B001.B003.B005",…}
    5: {bcode: "B006", cuicode: null, bname: "信息一部", btype: null, pbcode: "B002", bpath: "B001.B002.B006",…}
    6: {bcode: "B007", cuicode: null, bname: "信息二部", btype: null, pbcode: "B002", bpath: "B001.B002.B007",…}
    

    前端处理(树状,符合el-tree)

    this.$http(this.$api.CLDBSBB01,{})
            .then(res=>{
            let data = res.data;
            let dataMap = new Map()
            data.forEach(item => {
              item.children = []
              dataMap.set(item.bcode, item)
            })
            data.forEach(item => {
              let parent = dataMap.get(item.pbcode)
              if (parent && item.bcode !== item.pbcode) {
                parent.children.push(item)
              } else {
                this.departList.push(item)
              }
            })
          })
    
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值