PHP递归

概述functionrecursion($data,$id=0,$level=0){$list=array();foreach($dataas$v){if($v['pid']==$id){$v['level']=$level;$v['son']=$this->rec

function recursion($data, $ID = 0, $level = 0)    {        $List = array();        foreach ($data as $v) {            if ($v['pID'] == $ID) {                $v['level'] = $level;                $v['son'] = $this->recursion($data, $v['ID'], $level + 1);                if (empty($v['son'])) {                    unset($v['son']);                }                array_push($List, $v);            }        }        return $List;    }

function generateTree($data){        $items = array();        foreach($data as $v){            $items[$v['ID']] = $v;        }        $tree = array();        foreach($items as $k => $item){            if(isset($items[$item['pID']])){                $items[$item['pID']]['son'][] = &$items[$k];            }else{                $tree[] = &$items[$k];            }        }        return $tree;    }

总结

以上是内存溢出为你收集整理的PHP递归全部内容，希望文章能够帮你解决PHP递归所遇到的程序开发问题。

如果觉得内存溢出网站内容还不错，欢迎将内存溢出网站推荐给程序员好友。