节点树类型脚本

Question

我在原始数据中有一个json，未排序如下：

[
{
"level": 1,
"id": 34,
"name": "example-name",
"father_id": 10
},
{
"level": 3,
"id": 48521,
"name": "example-name",
"father_id": 684
},
{
"level": 5,
"id": 12138,
"name": "example-name",
"father_id": 213
},

{
"level": 4,
"id": 5679,
"name": "example-name",
"father_id": 12138
},
{
"level": 5,
"id": 4789,
"name": "example-name",
"father_id": 10769
},
{
"level": 3,
"id": 998797988,
"name": "example-name",
"father_id": 5679
},
{
"level": 3,
"id": 987987777,
"name": "example-name",
"father_id": 5679
},
{
"level": 4,
"id": 4417,
"name": "example-name",
"father_id": 4789
},
{
"level": 3,
"id": 12138,
"name": "example-name",
"father_id": 4417
},
{
"level": 4,
"id": 5678,
"name": "example-name",
"father_id": 12138
},
{
"level": 3,
"id": 998797987,
"name": "example-name",
"father_id": 5678
},
{
"level": 5,
"id": 326,
"name": "example-name",
"father_id": 20
},
{
"level": 4,
"id": 684,
"name": "example-name",
"father_id": 326
},
{
"level": 2,
"id": 54444,
"name": "example-name",
"father_id": 26580
}
]

我的最终目标是能够得到这样的结果：

[
{
"parent": {
"level": 5,
"id": 12138,
"name": "example-name",
"father_id": 213
},
"children": [
{
"level": 3,
"id": 998797987,
"name": "example-name",
"father_id": 5678
},
{
"level": 3,
"id": 998797988,
"name": "example-name",
"father_id": 5679
},
{
"level": 3,
"id": 987987777,
"name": "example-name",
"father_id": 5679
}
]
},
{
"parent": {
"level": 5,
"id": 326,
"name": "example-name",
"father_id": 20
},
"children": [
{
"level": 3,
"id": 48521,
"name": "example-name",
"father_id": 684
}
]
},
{
"parent" : {
"level": 5,
"id": 4789,
"name": "example-name",
"father_id": 10769
},
"children": [
{
"level": 3,
"id": 12138,
"name": "example-name",
"father_id": 4417
}
]
}
]

为了让您了解它是如何工作的，我创建了这个中间json:

[
{
"parent": {
"level": 5,
"id": 12138,
"name": "example-name",
"father_id": 213
},
"children": [
{
"parent": {
"level": 4,
"id": 5678,
"name": "example-name",
"father_id": 12138
},
"children": [
{
"level": 3,
"id": 998797987,
"name": "example-name",
"father_id": 5678
}
]
},
{
"parent": {
"level": 4,
"id": 5679,
"name": "example-name",
"father_id": 12138
},
"children": [
{
"level": 3,
"id": 998797988,
"name": "example-name",
"father_id": 5679
},
{
"level": 3,
"id": 987987777,
"name": "example-name",
"father_id": 5679
}
]
}
]
},
{
"parent": {
"level": 5,
"id": 326,
"name": "example-name",
"father_id": 20
},
"children": [
{
"parent": {
"level": 4,
"id": 684,
"name": "example-name",
"father_id": 326
},
"children": [{
"level": 3,
"id": 48521,
"name": "example-name",
"father_id": 684
}]
}
]
},
{
"parent" : {
"level": 5,
"id": 4789,
"name": "example-name",
"father_id": 10769
},
"children": [
{
"parent": {
"level": 4,
"id": 4417,
"name": "example-name",
"father_id": 4789
},
"children": [
{
"level": 3,
"id": 12138,
"name": "example-name",
"father_id": 4417
}
]
}
]
}
]

在前面的json中，每个father_id都链接到其父级的id。

我在json中有不同的level(6比1(。我对level 5和level 3之间的关系感兴趣。

以下是我在打字中所做的：

const families: { parent: Treeview; children: Treeview[] }[] = []
arrayTreeViews.forEach(node => {
// keep level between 3 to 5
if ( node.level < 3 || node.level > 5 ) return
// get root parent
if ( node.level === 4 ) families.push({parent: node, children: []})
// issue with the following line is :
// as the array is not sorted the node itself might not has any parent yet...
const parentIndex = families.findIndex(el => el.parent.id === node.fatherId)
if ( parentIndex !== -1 ) {
families[parentIndex].children.push(node)
return
}
})

如何在typescript中以最有效的方式实现预期的json结果？

我想先在属性级别上对数组进行排序，但我不知道如何直接获得level 5和level 3之间的关系

谢谢你的帮助！

编辑：

消息被删除，因为它是错误的解决方案：/

第2版：找到了解决方案：所以问题和前面一样？这是最好的方法/最有效的方法吗？感谢您的帮助/建议

const rootLevel: { parent: Treeview; children: Treeview[] }[] = []
const subLevel: Treeview[] = []
const lowerLevel: Treeview[] = []
arrayTreeViews.forEach(node => {
if ( node.level === 4 ) rootLevel.push({parent: node, children: []})
if ( node.level === 3 ) subLevel.push(node)
if ( node.level === 2 ) lowerLevel.push(node)
})
subLevel.forEach(node => {
const parentIndex = rootLevel.findIndex(el => el.parent.id === node.fatherId)
const familyTreeView = lowerLevel.filter(el => el.fatherId === node.id)
if ( familyTreeView && parentIndex !== -1) {
rootLevel[parentIndex].children.push(...familyTreeView)
}
})
res.json(rootLevel)

Answer 1

编辑：由于问题发生了变化，我不得不写一个新的答案

const findChildren = (tree: Treeview[], node: Treeview) =>
tree.filter(
(treeNode) =>
treeNode.level === node.level - 1 && treeNode.father_id === node.id
);
const findGrandchildren = (tree: Treeview[], node: Treeview) =>
findChildren(tree, node).flatMap((child) => findChildren(tree, child));
const families = arrayTreeViews
.filter((view) => view.level === 5)
.map((view) => ({
parent: view,
children: findGrandchildren(arrayTreeViews, view),
}));

原始答案：

我在这里使用递归函数：

const getRelation = (
tree: Treeview[],
lowerLevelBound: number,
level: number,
fatherId?: number
) => {
// Find nodes with the given level
const currentLevelNodes = tree.filter(
(node) =>
node.level === level &&
// If fatherId is not null, filter nodes with wanted father_id
(fatherId == null ? true : node.father_id === fatherId)
);
// We hit the lower level bound -- exit algorithm
if (level === lowerLevelBound) return currentLevelNodes;
return currentLevelNodes.map((node) => ({
parent: node,
children: getRelation(tree, lowerLevelBound, level - 1, node.id),
}));
};
const lowerLevelBound = 3;
const upperLevelBound = 5;
const families = getRelation(arrayTreeViews, lowerLevelBound, upperLevelBound);

它的工作原理是只过滤级别为5的节点，然后递归地将它们映射到父子关系