Id,Pid生成树型结构

部分情况下,后端可能只返回一个数据列表,并没有返回完全的树型结构。


问题描述:

那么问题来,前端需要如何转换呢?
后端数据返回如下:

//从后端获取到的数据列表:
[
    {
        "id": 1,
        "resourceCodeId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "resourceName": "账户管理",
        "parentId": null,
        "path": "/accountManagement",
        "icon": "el-icon-s-tools"
    },
    {
        "id": 3003,
        "resourceCodeId": "e57d1f74-e1e3-4fbd-8fc4-7d57e2d2c097",
        "resourceName": "角色管理",
        "parentId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "path": "/accountManagement/role",
        "icon": ""
    },
        {
        "id": 5,
        "resourceCodeId": "412a3255-347a-46d3-aa61-506b92f5d35e",
        "resourceName": "员工管理",
        "parentId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "path": "/accountManagement/staff",
        "icon": ""
    },
]

解决方案:

可以根据Id,Pid进行树形结构的转换


	// 获取到后端数据列表后,将数组和父级的parentId传入自定义方法
		orgStructureFecht() {
			accountAPI.orgStructure().then(res => {
				if (res.code == 0) {
					this.data = this.getTree(res.data, null)
					console.log('🚀 ~ :',this.data)
				}
			})
		},
		getTree(data, parentId) {
			let result = []
			let temp
			for (let i = 0; i < data.length; i++) {
				/*if (data[i].nameZhCn != null) {
					data[i].label = data[i].nameZhCn
				}*/
				if (data[i].parentId== parentId) {
					temp = this.getTree(data, data[i].resourceCodeId)
					if (temp.length > 0) {
						data[i].children = temp
					}
					result.push(data[i])
				}
			}
			return result
		}
		

ok!完美解决

下面就是通过id,pid生成的树形结构了

{
        "id": 1,
        "resourceCodeId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "resourceName": "账户管理",
        "parentId": null,
        "path": "/accountManagement",
        "icon": "el-icon-s-tools",
        "children": [
            {
                "id": 5,
                "resourceCodeId": "412a3255-347a-46d3-aa61-506b92f5d35e",
                "resourceName": "员工管理",
                "parentId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
                "path": "/accountManagement/staff",
                "icon": ""
            },
            {
                "id": 3003,
                "resourceCodeId": "e57d1f74-e1e3-4fbd-8fc4-7d57e2d2c097",
                "resourceName": "角色管理",
                "parentId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
                "path": "/accountManagement/role",
                "icon": ""
            },
        ]
    }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值