1.需求:把数组结构转换成树形结构
2.完成代码:
const data = [
{ id: "01", name: "张大大", pid: "", job: "项目经理" },
{ id: "02", name: "小亮", pid: "01", job: "产品leader" },
{ id: "03", name: "小美", pid: "01", job: "UIleader" },
{ id: "04", name: "老马", pid: "01", job: "技术leader" },
{ id: "05", name: "老王", pid: "01", job: "测试leader" },
{ id: "06", name: "老李", pid: "01", job: "运维leader" },
{ id: "07", name: "小丽", pid: "02", job: "产品经理" },
{ id: "08", name: "大光", pid: "02", job: "产品经理" },
{ id: "09", name: "小高", pid: "03", job: "UI设计师" },
{ id: "10", name: "小刘", pid: "04", job: "前端工程师" },
{ id: "11", name: "小华", pid: "04", job: "后端工程师" },
{ id: "12", name: "小李", pid: "04", job: "后端工程师" },
{ id: "13", name: "小赵", pid: "05", job: "测试工程师" },
{ id: "14", name: "小强", pid: "05", job: "测试工程师" },
{ id: "15", name: "小涛", pid: "06", job: "运维工程师" },
];
function arrToTree(data) {
// 1.先筛选出大Boss项目经理(张大大)
// 创建一个空对象 用来装项目经理
pM = {};
data.forEach((arr) => {
arr.lable = arr["name"];
delete arr.name;
delete arr.job;
if (arr.id === "01") {
// console.log(arr);
delete arr.id;
delete arr.pid;
pM = arr;
// console.log(pM); // lable:张大大
}
});
// 2. 找出项目经理对应pid为01的成员
// 给大boss张大大创建Children数组
pM.Children = [];
data.forEach((arr) => {
if (arr.pid === "01") {
// 解构赋值
const nemArr = { ...arr };
// 给pid为01的成员创建Children数组
nemArr.Children = [];
// console.log(nemArr);
// 把pid为01的成员添加到大boss.Children数组里
pM.Children.push(nemArr);
// console.log(nemArr);
}
});
// 3. 找出剩余成员
// 判断条件:pid不能为'' 且不能等于 01
const rests = data.filter((arr) => {
return arr.pid !== "" && arr.pid !== "01";
});
// rests = 筛选好的剩余成员
rests.forEach((arr) => {
//再遍历大boss手下成员的id号与剩余成员对应的pid号
pM.Children.forEach((item) => {
if (arr.pid === item.id) {
delete arr.id;
delete arr.pid;
// 再对应添加到相匹配的成员
item.Children.push(arr);
// console.log(item);
}
});
});
pM.Children.forEach((arr) => {
delete arr.id;
delete arr.pid;
});
return pM;
}
const treeData = arrToTree(data);
console.log(treeData);