从另一个数组递归创建一个数组


Recursively Create an Array from another Array

我正在尝试使多维数组构建一个添加hr字段的数组路径,因此它看起来像这样:

我只是不知道如何添加总计,也不知道如何创建一个子数组,以便在选项中使用点符号。我的目标是得到这样的东西

      [1] => [1][2][1][5][0][6] = 35 (the second child path "1")
      [1] => [1][2][1][5][0][7] = 25 

或类似这样的东西:

   array (
      [children.0.children.0.children.0.total] = 20
      [children.0.children.1.children.1.total] = 35
      // etc
   )

复杂的部分是它朝着不同的方向发展,我想知道基于路径的最高和最低总数是多少:

==> 在此处运行代码或复制/粘贴

// -------------
// The Flattener
// -------------
function doit($myArray) {
    $iter = new RecursiveIteratorIterator(new RecursiveArrayIterator($myArray));
    $result = array();
    foreach ($iter as $leafKey => $leafValue) {
        $keys = array();
        foreach (range(0, $iter->getDepth()) as $depth) {
            $keys[] = $iter->getSubIterator($depth)->key();
        }
        $result[ join('.', $keys) ] = $leafValue;
    }
    return $result;
}
// -------------
// Example Tree
// -------------
$tree = [
    'id' => 1,
    'type' => 'note',
    'data' => [],
    'children' => [
        [
            'id' => 2,
            'type' => 'wait',
            'data' => [
                'hr' => 10,
            ],
            'children' => [
                [
                    'id' => 3,
                    'type' => 'wait',
                    'data' => [
                        'hr' => 10,
                    ],
                    'children' => [
                        'id' => 4,
                        'type' => 'exit',
                        'data' => [],
                        'children' => []
                    ]
                ],
                [
                    'id' => 5,
                    'type' => 'note',
                    'data' => [
                        'hr' => 10,
                    ],
                    'children' => [
                        [
                            'id' => 6,
                            'type' => 'wait',
                            'data' => [
                                'hr' => 10,
                            ],
                            'children' => []
                        ],
                        [
                            'id' => 7,
                            'type' => 'exit',
                            'data' => [],
                            'children' => []
                        ],
                    ]
                ]
            ],
        ]
    ]
];    
$result = doit($tree);
print_r($result);

这似乎有效,我整天在谷歌上搜索它。

array_reduce(array_reverse($keys), function($parent_array, $key) {
    return $parent_array ? [$key => $parent_array] : [$key];
}, null);