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

php 复制代码

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作为参数，并递归地构建一个树形结构的数组。通过调用getCategoryTree函数并传入示例数据后，将会输出一个包含层级关系的分类树。您可以根据实际需求修改示例数据和函数逻辑。

php 复制代码

// 模拟分类数据
$categories = array(
    array('id' =&gt; 1, 'name' =&gt; '电子产品', 'parent_id' =&gt; 0),
    array('id' =&gt; 2, 'name' =&gt; '手机', 'parent_id' =&gt; 1),
    array('id' =&gt; 3, 'name' =&gt; '笔记本电脑', 'parent_id' =&gt; 1),
    array('id' =&gt; 4, 'name' =&gt; '家用电器', 'parent_id' =&gt; 0),
    array('id' =&gt; 5, 'name' =&gt; '电视', 'parent_id' =&gt; 4),
    array('id' =&gt; 6, 'name' =&gt; '冰箱', 'parent_id' =&gt; 4),
    array('id' =&gt; 7, 'name' =&gt; '空调', 'parent_id' =&gt; 4),
    array('id' =&gt; 8, 'name' =&gt; '服饰', 'parent_id' =&gt; 0),
    array('id' =&gt; 9, 'name' =&gt; '男装', 'parent_id' =&gt; 8),
    array('id' =&gt; 10, 'name' =&gt; '女装', 'parent_id' =&gt; 8),
    array('id' =&gt; 11, 'name' =&gt; '鞋类', 'parent_id' =&gt; 0),
    array('id' =&gt; 12, 'name' =&gt; '男鞋', 'parent_id' =&gt; 11),
    array('id' =&gt; 13, 'name' =&gt; '女鞋', 'parent_id' =&gt; 11),
    array('id' =&gt; 14, 'name' =&gt; '数码产品', 'parent_id' =&gt; 1),
    array('id' =&gt; 15, 'name' =&gt; '相机', 'parent_id' =&gt; 14),
    array('id' =&gt; 16, 'name' =&gt; '摄像机', 'parent_id' =&gt; 14),
    array('id' =&gt; 17, 'name' =&gt; '办公用品', 'parent_id' =&gt; 0),
    array('id' =&gt; 18, 'name' =&gt; '文具', 'parent_id' =&gt; 17),
    array('id' =&gt; 19, 'name' =&gt; '办公设备', 'parent_id' =&gt; 17),
    array('id' =&gt; 20, 'name' =&gt; '电脑配件', 'parent_id' =&gt; 1),
    array('id' =&gt; 21, 'name' =&gt; '显示器', 'parent_id' =&gt; 20),
    array('id' =&gt; 22, 'name' =&gt; '内存条', 'parent_id' =&gt; 20),
    array('id' =&gt; 23, 'name' =&gt; '游戏机', 'parent_id' =&gt; 1),
    array('id' =&gt; 24, 'name' =&gt; 'PS5', 'parent_id' =&gt; 23),
    array('id' =&gt; 25, 'name' =&gt; 'Switch', 'parent_id' =&gt; 23),
);
// 递归处理分类数据
function buildTree($categories, $parent_id = 0) {
    $tree = array();
    foreach ($categories as $category) {
        if ($category['parent_id'] == $parent_id) {
            $children = buildTree($categories, $category['id']);
            if ($children) {
                $category['children'] = $children;
            }
            $tree[] = $category;
        }
    }
    return $tree;
}
// 构建树形结构
$tree = buildTree($categories);
// 显示分类数据
function showTree($tree, $indent = 0) {
    foreach ($tree as $category) {
        echo str_repeat("--", $indent) . $category['name'] . "&lt;br&gt;";
        if (isset($category['children'])) {
            showTree($category['children'], $indent + 1);
        }
    }
}
// 调用函数显示树形结构
showTree($tree);</pre></div>