0

嗨，我正在从服务接收一个平面数组，如下所示

    [0] [] (@bf4f219)   
    [0] Object (@a55f1a9)   
        breadcrumb  "{2}"   
        entity_name "parent 2"  
        id  2   
        level   1   
        parent_id   0

    [1] Object (@a5be281)   
        breadcrumb  "{2,4}" 
        entity_name "child for parent 2"    
        id  4   
        level   2   
        parent_id   2

    [2] Object (@a5bea01)   
        breadcrumb  "{2,4,5}"   
        entity_name "child for 4"   
        id  5   
        level   3   
        parent_id   4

    [3] Object (@a5ed179)   
        breadcrumb  "{2,4,5,7}" 
        entity_name "child for 5"   
        id  7   
        level   4   
        parent_id   5

    [4] Object (@a5ed6d1)   
        breadcrumb  "{2,6}" 
        entity_name "child 2 for parent 2"  
        id  6   
        level   2   
        parent_id   2

    [5] Object (@a5edb09)   
        breadcrumb  "{2,8}" 
        entity_name "another child for 2"   
        id  8   
        level   2   
        parent_id   2

    [6] Object (@a5edda9)   
        breadcrumb  "{2,9}" 
        entity_name "another child for 2"   
        id  9   
        level   2   
        parent_id   2

我需要做的是根据每个对象中提供的 id 和 parent_id 构造一个多维数组，请注意，如果有帮助，还为每个项目提供维度内的级别。

我有一个真正的大脑空白，无法弄清楚这一点，请帮助，因为我必须快速找到解决方案。

提前致谢。

4

1 回答 1

0

由于您可以在根级别拥有任意数量的 parent_id，因此您最终可以得到多个树。

试试这个，祝你好运：

    var trees:Array = buildTrees(FLAT);

    private static const FLAT:Array =
    [
        {breadcrumb: "{2}", entity_name: "parent 2",
            id:         2,   
            level:      1,   
            parent_id:  0},

        {breadcrumb: "{2,4}", entity_name: "child for parent 2",    
            id:         4,   
            level:      2,   
            parent_id:  2},

        {breadcrumb: "{2,4,5}", entity_name: "child for 4",   
            id:         5,
            level:      3,
            parent_id:  4},

        {breadcrumb: "{2,4,5,7}", entity_name: "child for 5",   
            id:         7,
            level:      4,
            parent_id:  5},

        {breadcrumb: "{2,6}", entity_name: "child 2 for parent 2",
            id:         6,
            level:      2,
            parent_id:  2},

        {breadcrumb: "{2,8}", entity_name: "another child for 2",   
            id:         8,   
            level:      2,
            parent_id:  2},

        {breadcrumb: "{2,9}", entity_name: "another child for 2",   
            id:         9,
            level:      2,
            parent_id:  2}
    ];

    private function buildTrees(flat:Array):Array
    {
        if (!flat.length)
            return null;

        flat.sortOn("parent_id", Array.NUMERIC);

        var trees:Array = new Array();

        var i:uint;

        for (i = 0; i < flat.length; i ++)
        {
            var node:Object = {parent_id: flat[i].parent_id, id: flat[i].id, level: flat[i].level,
                breadcrumb: flat[i].breadcrumb, entity_name: flat[i].entity_name, nodes: new Array()};

            var root:Object = findRoot(flat[i].parent_id, trees);

            if (root) {
                root.nodes.push(node);
            }
            else
                trees.push(node);
        }

        for (i = 0; i < trees.length; i ++)
            sortTree(trees[i]);

        return trees;
    }

    private function findRoot(parent_id:int, trees:Array):Object
    {
        for (var i:uint = 0; i < trees.length; i ++)
        {
            var node:Object = findNode(parent_id, trees[i]);

            if (node)
                return node;
        }

        return null;
    }

    private function findNode(parent_id:int, root:Object):Object
    {
        if (root.id == parent_id)
            return root;

        for (var i:uint = 0; i < root.nodes.length; i ++)
        {
            var node:Object = findNode(parent_id, root.nodes[i]);

            if (node)
                return node;
        }

        return null;
    }

    private function sortTree(root:Object):void
    {
        root.nodes.sortOn("level", Array.NUMERIC);

        for (var i:uint = 0; i < root.nodes.length; i ++)
            sortTree(root.nodes[i]);
    }
于 2013-06-26T12:52:03.427 回答