PHP处理无限层级分类的递归函数

历史老师-

已于 2024-07-26 15:24:20 修改

阅读量575

点赞数 1

CC 4.0 BY-SA版权

分类专栏： php 文章标签： python 前端 php

于 2024-07-26 15:17:19 首次发布

本文链接：https://blog.csdn.net/qq_32450471/article/details/140716517

function getCategoryTree($categories, $parent_id = 0) {
    $tree = array();
    
    foreach ($categories as $category) {
        if ($category['parent_id'] == $parent_id) {
            $children = getCategoryTree($categories, $category['id']);
            if ($children) {
                $category['children'] = $children;
            }
            $tree[] = $category;
        }
    }
    
    return $tree;
}

// 示例数据
$categories = array(
    array('id' => 1, 'name' => 'Category 1', 'parent_id' => 0),
    array('id' => 2, 'name' => 'Category 2', 'parent_id' => 0),
    array('id' => 3, 'name' => 'Category 1.1', 'parent_id' => 1),
    array('id' => 4, 'name' => 'Category 1.2', 'parent_id' => 1),
    array('id' => 5, 'name' => 'Category 1.1.1', 'parent_id' => 3),
);

$tree = getCategoryTree($categories);
print_r($tree);

在上面的例子中，getCategoryTree函数接受一个包含所有分类的数组和一个父分类ID