1.题目如下:
打平的数据结构如下:
let arr = [ {id: 1, name: '部门1', pid: 0}, {id: 2, name: '部门2', pid: 1}, {id: 3, name: '部门3', pid: 1}, {id: 4, name: '部门4', pid: 3}, {id: 5, name: '部门5', pid: 4}, ]
转换后的代码结构如下:
[
{
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:[]
}
]
}
]
}
]
}
]
一、使用递归的方法将其转换为tree,此时的时间复杂度为O(2^n),代码如下:
/**
* 递归查找,获取children
*/
const getChildren = (data, result, pid) => {
for (const item of data) {
if (item.pid === pid) {
const newItem = {...item, children: []};
result.push(newItem);
getChildren(data, newItem.children, item.id);
}
}
}
/**
* 转换方法
*/
const arrayToTree = (data, pid) => {
const result = [];
getChildren(data, result, pid)
return result;
}
二、将数据用Map结构去存储,然后遍历数据时利用对象的引用方式去找数据的对应关系,性能更好,时间复杂度为O(n)
function arrayToTree(items) {
const result = []; // 存放结果集
const itemMap = {}; //
for (const item of items) {
const id = item.id;
const pid = item.pid;
if (!itemMap[id]) {
itemMap[id] = {
children: [],
}
}
itemMap[id] = {
...item,
children: itemMap[id]['children']
}
const treeItem = itemMap[id];
if (pid === 0) {
result.push(treeItem);
} else {
if (!itemMap[pid]) {
itemMap[pid] = {
children: [],
}
}
itemMap[pid].children.push(treeItem)
}
}
return result;
}