
扁平化树形数组转换
问题:
如何将扁平化的数组转换为树形数组结构?
原始数组:
const arr = [
{id: 4, pid: 3},
{id: 'aa',pid:'a'},
{id: 1, pid: null},
{id: 3, pid: 2},
{id: 'a',pid: 'a0'},
{id: 2, pid: 1},
{id: 'a0',pid: null}
]; 期望结果:
[
{
"id": 1,
"pid": null,
"children": [
{
"id": 2,
"pid": 1,
"children": [
{
"id": 3,
"pid": 2,
"children": [
{
"id": 4,
"pid": 3
}
]
}
]
}
]
},
{
"id": "a0",
"pid": null,
"children": [
{
"id": "a",
"pid": "a0",
"children": [
{
"id": "aa",
"pid": "a"
}
]
}
]
}
]代码实现:
arr.reduce((o, i) => {
i = object.assign(o[i.id] ??= {}, i);
((o[i.pid ?? ''] ??= {}).children ??= []).push(i);
return o;
}, {})['']?.children结果:
[
{
"id": 1,
"pid": null,
"children": [
{
"id": 2,
"pid": 1,
"children": [
{
"id": 3,
"pid": 2,
"children": [
{
"id": 4,
"pid": 3
}
]
}
]
}
]
},
{
"id": "a0",
"pid": null,
"children": [
{
"id": "a",
"pid": "a0",
"children": [
{
"id": "aa",
"pid": "a"
}
]
}
]
}
]以上就是如何将扁平化的数组转换成树形结构?的详细内容,更多请关注php中文网其它相关文章!
每个人都需要一台速度更快、更稳定的 PC。随着时间的推移,垃圾文件、旧注册表数据和不必要的后台进程会占用资源并降低性能。幸运的是,许多工具可以让 Windows 保持平稳运行。
Copyright 2014-2025 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号