let menuList = [
{
menuId: 1,
name: "系统管理1",
parentMenu: null,
},
{
menuId: 2,
name: "系统管理2",
parentMenu: null,
},
{
menuId: 3,
name: "系统管理1_0",
parentMenu: 1,
},
{
menuId: 4,
name: "系统管理1_1",
parentMenu: 1,
},
{
menuId: 5,
name: "系统管理2_0",
parentMenu: 2,
},
{
menuId: 6,
name: "系统管理2_2_0",
parentMenu: 5,
},
{
menuId: 7,
name: "系统管理3",
parentMenu: null,
},
{
menuId: 8,
name: "系统管理1-1-2",
parentMenu: 4,
},
];
function arrayToTree(menuList: any, pid = null) {
let arr = [];
menuList.forEach((item) => {
if (item.parentMenu == pid) {
let child = arrayToTree(menuList, item.menuId);
if (child.length > 0) {
item.clidren = child;
}
arr.push(item);
}
});
return arr;
}
console.log(arrayToTree(menuList));
数组转树结构
最新推荐文章于 2024-09-13 23:32:49 发布