如何在javascript中将嵌套集转换为嵌套数组？

Question

有以下数据。

[
    {"no":1, "name":"ELECTRONICS", "depth":0},
    {"no":2, "name":"TELEVISIONS", "depth":1},
    {"no":3, "name":"TUBE", "depth":2},
    {"no":4, "name":"LCD", "depth":2},
    {"no":5, "name":"PLASMA", "depth":2},
    {"no":6, "name":"PORTABLE ELECTRONICS", "depth":1},
    {"no":7, "name":"MP3 PLAYERS", "depth":2},
    {"no":8, "name":"FLASH", "depth":3},
    {"no":9, "name":"CD PLAYERS", "depth":2},
    {"no":10, "name":"2 WAY RADIOS", "depth":2}
]

我想获得如下数据。

[
    {
        "no":1,
        "name":"ELECTRONICS",
        "depth":0,
        "child_nodes":[
            {
                "no":2,
                "name":"TELEVISIONS",
                "depth":1
                "child_nodes":[
                    {
                        "no":3,
                        "name":"TUBE",
                        "depth":2
                    },
                    ...
                ]
            },
            {
                "no":6,
                "name":"PORTABLE ELECTRONICS",
                "depth":1
                "child_nodes":[ ... ]
            }
        ]
    }
]

我正在递归地尝试它，但它并不好。 由于我使用的是babel，因此对javascript的新功能没有很大的限制。 如果你有个好主意，请告诉我。 谢谢！

Answer 1

您可以为级别使用辅助数组。

 var array = [{ no: 1, name: "ELECTRONICS", depth: 0 }, { no: 2, name: "TELEVISIONS", depth: 1 }, { no: 3, name: "TUBE", depth: 2 }, { no: 4, name: "LCD", depth: 2 }, { no: 5, name: "PLASMA", depth: 2 }, { no: 6, name: "PORTABLE ELECTRONICS", depth: 1 }, { no: 7, name: "MP3 PLAYERS", depth: 2 }, { no: 8, name: "FLASH", depth: 3 }, { no: 9, name: "CD PLAYERS", depth: 2 }, { no: 10, name: "2 WAY RADIOS", depth: 2 }], result = [], levels = [{ children: result }]; array.forEach(function (o) { levels[o.depth].children = levels[o.depth].children || []; levels[o.depth].children.push(levels[o.depth + 1] = o); }); console.log(result); 

 .as-console-wrapper { max-height: 100% !important; top: 0; } 

Answer 2

//The trees root = our expected result  
 const result = [];
 var acc  = { depth: -1, children: result};

 for(const el of data){
   //walk upwards in the tree
   var up = acc.depth - el.depth + 1 ;
   while(up--){ acc = acc.parent }
   //walk down and add the current el as a child
   el.parent = acc;
   (acc.children || (acc.children = [])).push(el);
   acc = el;
}

console.log(result);

您可以只穿过一棵树（acc）并将父母/孩子联系在一起。