我想重组一个数组，stuckoverflow上的一些解决方案帮助我使其"适合"1级项目，但您会注意到该数组是n级深度的。
方法restructure（）不是递归使用的（应该是）。这可能是错误的，不知道如何使它正确。
children键表示存在具有相应id的子项，parent密钥将项目链接到父id。
class FilterMenu {
protected $tree = array();
static protected $structure = array();
public function __construct(array $tree)
{
$this->tree = $tree;
}
public function getStructure()
{
self::restructure($this->tree);
return self::$structure;
}
static public function restructure(array $structure)
{
foreach ($structure as $k => $v)
{
if (isset($v['parent']) and isset($v['children']) and count($v['children']) == 1)
{
// only 1 child
self::$structure[$k] = current(array_keys($v['children']));
}
elseif (isset($v['children']))
{
$keys = array_keys($v['children']);
self::$structure[$k] = array_combine($keys, $keys); // mirror array
//self::restructure($v['children']);
}
else
{
// no children
self::$structure[$k] = $k;
}
}
}
}
// test array
$tree = array(
1 => array(
'parent' => 1
),
2 => array(
'parent' => 2,
'children' => array(
3 => array(
'parent' => 2
),
6 => array(
'parent' => 2,
'children' => array(
10 => array(
'parent' => 6,
'children' => array(
4 => array(
'parent' => 10
)
)
)
),
),
),
),
7 => array(
'parent' => 7,
'children' => array(
11 => array(
'parent' => 7
)
)
),
14 => array(
'parent' => 14,
'children' => array(
15 => array(
'parent' => 14,
),
16 => array(
'parent' => 14,
),
19 => array(
'parent' => 14,
),
20 => array(
'parent' => 14,
),
21 => array(
'parent' => 14,
),
)
)
);
// test:
$tree = new FilterMenu($tree);
echo '<pre>'.print_r($tree->getStructure(), true);
实际结果：
Array
(
[1] => 1
[2] => Array
(
[3] => 3
[6] => 6
)
[7] => 11
[14] => Array
(
[15] => 15
[16] => 16
[19] => 19
[20] => 20
[21] => 21
)
)
期望/期望的结果是：
Array
(
[1] => 1
[2] => Array
(
[3] => 3
[6] => Array
(
[10] => 4 // <-- array with n-levels...
)
)
[7] => 11
[14] => Array
(
[15] => 15
[16] => 16
[19] => 19
[20] => 20
[21] => 21
)
)
这是指向测试类和数组的codepad的链接。
非常感谢您的帮助。谢谢
我想你正在寻找这个：
function collapse(&$array) {
foreach ($array as $k => &$v) {
if (array_key_exists('children', $v)) {
collapse($v['children']);
$array[$k] = $v['children'];
} else {
$array[$k] = $k;
}
}
}
当这样称呼时：
collapse($tree);
print_r($tree);
生产：
Array (
[1] => 1
[2] => Array (
[3] => 3
[6] => Array (
[10] => Array (
[4] => 4
)
)
)
[7] => Array (
[11] => 11
)
[14] => Array (
[15] => 15
[16] => 16
[19] => 19
[20] => 20
[21] => 21
)
)
请参阅http://codepad.org/8atfSWGC