相關(guān)關(guān)鍵詞
關(guān)于我們
最新文章
PHP迭代與遞歸實現(xiàn)無限級分類
無限級分類是開發(fā)中常見的情況,因此本文對常見的無限極分類算法進行總結(jié)歸納.
1.循環(huán)迭代實現(xiàn)
$arr = [ 1=>['id'=>1,'name'=>'父1','father'=>NULL], 2=>['id'=>2,'name'=>'父2','father'=>NULL], 3=>['id'=>3,'name'=>'父3','father'=>NULL], 4=>['id'=>4,'name'=>'兒1-1','father'=>1], 5=>['id'=>5,'name'=>'兒1-2','father'=>1], 6=>['id'=>6,'name'=>'兒1-3','father'=>1], 7=>['id'=>7,'name'=>'兒2-1','father'=>2], 8=>['id'=>8,'name'=>'兒2-1','father'=>2], 9=>['id'=>9,'name'=>'兒3-1','father'=>3], 10=>['id'=>10,'name'=>'兒3-1-1','father'=>9], 11=>['id'=>11,'name'=>'兒1-1-1','father'=>4], 12=>['id'=>12,'name'=>'兒2-1-1','father'=>7], ]; function generateTree($items){ $tree = array(); foreach($items as $item){ if(isset($items[$item['father']])){ $items[$item['father']]['son'][] = &$items[$item['id']]; }else{ $tree[] = &$items[$item['id']]; } } return $tree; } $tree = generateTree($arr); print_r(json_encode($tree));