我一直在寻找解决方案,但没有取得真正的成功.我有一个多维的父母和孩子阵列,对深度没有限制.这是从数据库生成的,但问题是项目ID成为关键,使用我的方式将平面数组排列成多维数组,如下所示:
Array(
[28] => Array
(
[id] => 28
[color] => #ff24e5
[name] => Personal
[parent_id] =>
[children] => Array
(
[23] => Array
(
[id] => 23
[color] => #41c3a3
[name] => Shopping
[parent_id] => 28
[children] => Array
(
[22] => Array
(
[id] => 22
[color] => #8be32b
[name] => Deals
[parent_id] => 23
[children] => Array
(
)
)
)
)
[150] => Array
(
[id] => 150
[color] => #e9a3f0
[name] => Orders
[parent_id] => 28
[children] => Array
(
)
)
)
)
)
我想要的是一个执行以下功能的功能:
Array (
[0] => Array
(
[id] => 28
[color] => #ff24e5
[name] => Personal
[parent_id] =>
[children] => Array
(
[0] => Array
(
[id] => 23
[color] => #41c3a3
[name] => Shopping
[parent_id] => 28
[children] => Array
(
[0] => Array
(
[id] => 22
[color] => #8be32b
[name] => Deals
[user_id] => 1
[selected] => 0
[parent_id] => 23
[children] => Array
(
)
)
)
)
[1] => Array
(
[id] => 150
[color] => #e9a3f0
[name] => Orders
[parent_id] => 28
[children] => Array
(
)
)
)
)
)
基本上从0开始重新分配密钥.我尝试了很多方法,但我假设我需要找到一个递归解决方案,当我尝试它时,它会破坏我的数组.我正在阅读array_walk_recursive()函数,但我不知道该怎么做.基本上,有没有办法重置多维数组中的数字键?
谢谢您的帮助!