php 无限极分类

来源:互联网 发布:java throw 编辑:程序博客网 时间:2024/05/19 20:00

静态方法

static public function sortOut($cate,$pid=0,$level=0,$html='--'){
       $tree = array();
       foreach($cate as $v){
               if($v['pid'] == $pid){
                   $v['level'] = $level + 1;
                   $v['html'] = str_repeat($html, $level);
                   $tree[] = $v;
                   $tree = array_merge($tree, self::sortOut($cate,$v['id'],$level+1,$html));
                }
       }
       return $tree;
    }

原创粉丝点击