《PHP編程:php遞歸實(shí)現(xiàn)無限分類的方法》要點(diǎn):
本文介紹了PHP編程:php遞歸實(shí)現(xiàn)無限分類的方法,希望對(duì)您有用。如果有疑問,可以聯(lián)系我們。
PHP實(shí)戰(zhàn)本文實(shí)例講述了php遞歸實(shí)現(xiàn)無限分類的辦法.分享給大家供大家參考.具體如下:
PHP實(shí)戰(zhàn)
<?php
$rows = array(
array(
'id' => 1,
'name' => 'dev',
'parentid' => 0
),
array(
'id' => 2,
'name' => 'php',
'parentid' => 1
),
array(
'id' => 3,
'name' => 'smarty',
'parentid' => 2
),
array(
'id' => 4,
'name' => 'life',
'parentid' => 0
),
array(
'id' => 5,
'name' => 'pdo',
'parentid' => 2
),
array(
'id' => 6,
'name' => 'pdo-mysql',
'parentid' => 5
),
array(
'id' => 7,
'name' => 'java',
'parentid' => 1
)
);
// 72648
// 84072
function findChild(&$arr,$id){
$childs=array();
foreach ($arr as $k => $v){
if($v['parentid']== $id){
$childs[]=$v;
}
}
return $childs;
}
function build_tree($root_id){
global $rows;
$childs=findChild($rows,$root_id);
if(empty($childs)){
return null;
}
foreach ($childs as $k => $v){
$rescurTree=build_tree($v[id]);
if( null != $rescurTree){
$childs[$k]['childs']=$rescurTree;
}
}
return $childs;
}
$tree=build_tree(0);
echo memory_get_usage();
print_r($tree);
?>
PHP實(shí)戰(zhàn)希望本文所述對(duì)大家的php程序設(shè)計(jì)有所贊助.
維易PHP培訓(xùn)學(xué)院每天發(fā)布《PHP編程:php遞歸實(shí)現(xiàn)無限分類的方法》等實(shí)戰(zhàn)技能,PHP、MYSQL、LINUX、APP、JS,CSS全面培養(yǎng)人才。
轉(zhuǎn)載請(qǐng)注明本頁網(wǎng)址:
http://www.fzlkiss.com/jiaocheng/9400.html