算法思想--遞歸--分級

算法實現

<?php
function tree($list,$pid=0){
    $tree=array();
    foreach($list as $value){
        if($value['pid']==$pid){
            $tree[$value['id']]=$value;
            $tree[$value['id']]['child']=tree($list,$value['id']);
        }
    }
    return $tree;
}
$list=array(
    array(
       'id'=>1,
        'pid'=>0,
        'name'=>'IT技術',
    ),
    array(
        'id'=>2,
        'pid'=>0,
        'name'=>'智能手機',
    ),
    array(
        'id'=>3,
        'pid'=>1,
        'name'=>'編程語言',
    ),
    array(
        'id'=>4,
        'pid'=>2,
        'name'=>'蘋果手機',
    ),

);
$data=tree($list,0);
var_dump($data);
?>