測試數組算法
$array = [ ['id' => 1, 'pid' => 0, 'name' => '這是主類'], ['id' => 2, 'pid' => 0, 'name' => '這是主類'], ['id' => 3, 'pid' => 1, 'name' => '父級爲1子類'], ['id' => 4, 'pid' => 2, 'name' => '父級爲2子類'], ['id' => 5, 'pid' => 3, 'name' => '父級爲3子類'], ];
1、遞歸算法數組
function tree($array, $pid) { $tree = array(); foreach ($array as $key => $value) { if ($value['pid'] == $pid) { $value['child'] = tree($array, $value['id']); if (!$value['child']) { unset($value['child']); } $tree[] = $value; } } return $tree; } echo "<pre>" . print_r(tree($array, 1), 1) . "</pre>";
2、數組引用測試
function generateTree($rows, $id = 'id', $pid = 'pid') { $items = array(); foreach ($rows as $row) { $items[$row[$id]] = $row; } foreach ($items as $item) { $items[$item[$pid]]['son'][$item[$id]] = &$items[$item[$id]]; } return isset($items[0]['son']) ? $items[0]['son'] : array(); } echo "<pre>" . print_r(generateTree($array), 1) . "</pre>";