php 無限極分類尋找家譜樹

標籤：blog   io   ar   for   sp   div   on   cti   log   

1：迭代的效率要比遞迴高，字碼頁相對少些，所以尋找家譜樹推薦用迭代

 

$area = array(array(‘id‘=>1,‘name‘=>‘安徽‘,‘parent‘=>0),array(‘id‘=>2,‘name‘=>‘海澱‘,‘parent‘=>7),array(‘id‘=>3,‘name‘=>‘濉溪縣‘,‘parent‘=>5),array(‘id‘=>4,‘name‘=>‘昌平‘,‘parent‘=>7),array(‘id‘=>5,‘name‘=>‘淮北‘,‘parent‘=>1),array(‘id‘=>6,‘name‘=>‘朝陽‘,‘parent‘=>7),array(‘id‘=>7,‘name‘=>‘北京‘,‘parent‘=>0),array(‘id‘=>8,‘name‘=>‘上地‘,‘parent‘=>2));function gettree($arr,$id){$tree  = array();while($id !=0){foreach($arr as $v){if($v[‘id‘] == $id){$tree[] = $v;       //把找到的子數組放進空的tree數組裡$id = $v[‘parent‘];  //while迴圈時用到的。break;}    }}return $tree;}print_r(gettree($area,8));

　　

php 無限極分類尋找家譜樹