php 递归

function digui($data,$j=0,$lev=0)
{
$subs=array();//存放子孙数组
foreach ($data as $v){
if ($v['parent_id']==$j){
$v['length']=str_repeat('    ',$lev);
$subs[]=$v;
$subs=array_merge($subs,$this->digui($data,$v['rule_id'],$lev+1 ));
}

}
return $subs;
}
function digui($data,$j=0)
{
$subs=array();//存放子孙数组
foreach ($data as $v){
if ($v['parent_id']==$j){
$v['zi']=$this->digui($data,$v['rule_id'] );
$subs[]=$v;
}
}
return $subs;
}
原文地址:https://www.cnblogs.com/gjclr/p/7779466.html