主页 / 问题 / 610002
Accepted
Beginner
Asked:2020-01-02 05:58:45 +0000 UTC2020-01-02 05:58:45 +0000 UTC

显示类别树，但嵌套不受限制

  • 772

编码

$shop_categories = array(
    array(
        'title' => 'Компьютеры',
        'children' => array(
            array(
                'title' => 'Ноутбуки',
            ),
            array(
                'title' => 'Моноблоки',
            ),
            array(
                'title' => 'Системные блоки',
                'children' => array(
                    array(
                        'title' => 'Tower',
                    ),
                    array(
                        'title' => 'Mini Tower',
                    )
                )
            )
        )
    ),
    array(
        'title' => 'Бытовая техника',
        'children' => array(
            array(
                'title' => 'Пылесосы',
            ),
            array(
                'title' => 'Холодильники',
            )
        )
    )
);

带出树：

function drevo($shop_categories) {
    echo '<ul>';

    foreach ($shop_categories as $key){

      echo "<li>" . $key['title'] . "</li>" ; 

       if (isset($key['children'])){

            drevo($key['children']);
        }

    }

echo '</ul>';

}
drevo($shop_categories);

但是如果我们有无限的嵌套，那么这个

if (isset($key['children'])){

            drevo($key['children']);
        }

不会再滚动了。无限量怎么办。子目录的数量？

php

1 个回答

  1. Best Answer

    您有不同类型的外部和内部数组。工作代码将是这样的：

    function drevo($shop_category) {
    echo '<ul>';
    echo "<li>" . $shop_category['title'] . "</li>" ; 
    if (isset($shop_category['children'])){
        trees($shop_category['children']);
    }
    echo '</ul>';
}
function trees($categories) {
    echo '<ul>';
    for($i = 0; $i < count($categories); $i++) {
        drevo($categories[$i]);
    }
    echo '</ul>';
}
trees($shop_categories);
    • 0

相关问题