php菜单/评论数据递归分级算法的实现方法_php实例_

 $menuList = [ [ 'id' => 1,'parent_id' => 0, 'name' => '节点1'], [ 'id' => 2,'parent_id' => 1, 'name' => '节点1-1'], [ 'id' => 3,'parent_id' => 0, 'name' => '节点2'], [ 'id' => 4,'parent_id' => 3, 'name' => '节点2-1'], [ 'id' => 5,'parent_id' => 2, 'name' => '节点1-1-1'], [ 'id' => 6,'parent_id' => 1, 'name' => '节点1-2'], ];

 $treeList = [ [ children: [ children: [] ] ] [, children: [ children: [] ] ] ];

 $menu) { if ($menu['parent_id'] == 0) { $treeList[] = $menu; unset($menuList[$index]); } } } // 递归查找子节点 foreach ($treeList as &$tree) { foreach ($menuList as $index => $menu) { if (empty($tree['children'])) { $tree['children'] = []; } if ($menu['parent_id'] == $tree['id']) { $tree['children'][] = $menu; unset($menuList[$index]); } } if (! empty($tree['children'])) { $this->getMenuTree($tree['children'], $menuList); } else { // 递归临界点 return false; } } } } $menuList = [ [ 'id' => 1,'parent_id' => 0, 'name' => '节点1'], [ 'id' => 2,'parent_id' => 1, 'name' => '节点1-1'], [ 'id' => 3,'parent_id' => 0, 'name' => '节点2'], [ 'id' => 4,'parent_id' => 3, 'name' => '节点2-1'], [ 'id' => 5,'parent_id' => 2, 'name' => '节点1-1-1'], [ 'id' => 6,'parent_id' => 1, 'name' => '节点1-2'], ]; $treeList = []; (new Menu)->getMenuTree($treeList, $menuList); print_r($treeList);