本文實例講述了php可應(yīng)用于面包屑導(dǎo)航的遞歸尋找家譜樹實現(xiàn)方法。分享給大家供大家參考。具體實現(xiàn)方法如下：<?phpecho "

";$area = array(array("id"=>1,"area"=>"北京","pid"=>0),array("id"=>2,"area"=>"廣西","pid"=>0),array("id"=>3,"area"=>"廣東","pid"=>0),array("id"=>4,"area"=>"福建","pid"=>0),array("id"=>11,"area"=>"朝陽區(qū)","pid"=>1),array("id"=>12,"area"=>"海淀區(qū)","pid"=>1),array("id"=>21,"area"=>"南寧市","pid"=>2),array("id"=>45,"area"=>"福州市","pid"=>4),array("id"=>113,"area"=>"亞運村","pid"=>11),array("id"=>115,"area"=>"奧運村","pid"=>11),array("id"=>234,"area"=>"武鳴縣","pid"=>21)); function familytree($arr,$id){ static $list = array(); foreach($arr as $v){ if($v["id"]==$id){ familytree($arr,$v["pid"]); $list[] = $v; } } return $list;}print_r(familytree($list,113));?>

希望本文所述對大家的php程序設(shè)計有所幫助。

《新程序員》：云原生和全面數(shù)字化實踐50位技術(shù)專家共同創(chuàng)作，文字、視頻、音頻交互閱讀

總結(jié)

以上是生活随笔為你收集整理的php递归面包屑,php可应用于面包屑导航的递归寻找家谱树实现方法的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。