|
php数组递归方法
有如下php数组：
-
- function genTree5($items) {
- foreach ($items as $item)
- $items[$item['pid']]['son'][$item['id']] = &$items[$item['id']];
- return isset($items[0]['son']) ? $items[0]['son'] : array();
- }
方法二：
function findChild($arr,$id){ - $childs=array();
- foreach ($arr as $k => $v){
- if($v['pid']== $id){
- $childs[]=$v;
- }
- }
- // echo "
";print_r($childs);die();
- return $childs;
- }
function build_tree($root_id){ - global $items;
- $childs =array();
- $childs=findChild($items,$root_id);
- // print_r($childs);
- // die();
- if(empty($childs)){
- return null;
- }
- foreach ($childs as $k => $v){
- $rescurTree=build_tree($v['id']);
- if( null != $rescurTree){
- $childs[$k]['son']=$rescurTree;
- }
- }
- return $childs;
- }
-
|
本網站聲明
本文內容由網友自願投稿，版權歸原作者所有。本站不承擔相應的法律責任。如發現涉嫌抄襲或侵權的內容，請聯絡admin@php.cn
作者最新文章
-
2024-10-22 09:46:29
-
2024-10-13 13:53:41
-
2024-10-12 12:15:51
-
2024-10-11 22:47:31
-
2024-10-11 19:36:51
-
2024-10-11 15:50:41
-
2024-10-11 15:07:41
-
2024-10-11 14:21:21
-
2024-10-11 12:59:11
-
2024-10-11 12:17:31
