树状无限极分类getTree tree

最新推荐文章于 2024-05-14 10:36:31 发布

小鹏程序

最新推荐文章于 2024-05-14 10:36:31 发布

阅读量3.2k

点赞数

分类专栏： PHP

本文链接：https://blog.csdn.net/qq_35979073/article/details/79412413

版权

PHP 专栏收录该内容

21 篇文章

订阅专栏

树状无限极分类   提高2种方式
function getTree($list,$id=0,$level=0) {
    static $tree = array();
    foreach($list as $row) {
        if($row['pid']==$id) {
            $row['level'] = $level;
            $row['name'] = str_repeat('----',$level). $row['name'];
            $tree[] = $row;
            $this->getTree($list, $row['id'], $level + 1);
        }
    }
    return $tree;
}

function getTree($list,$pid=0,$level=0) {
    static $tree = array();
    foreach($list as $row) {
        if($row['dept_pid']==$pid) {
            $row['dept_level'] = $level;
            $tree[] = $row;
            getTree($list, $row['dept_id'], $level + 1);
        }
    }
    return $tree;
}