php递归无限极分类

标题

 

 

<?php
namespace app\index\controller;
use think\Db;

class Index
{
    public function index()
    {
        echo '<pre>';
        $pid = 0;
        $level = 2;//层数
        $tree =  $this->generateTree($pid,$level);
        print_r($tree);
    }

    public function generateTree( $pid = 0 , $level = 0){
        $array = Db::name('test')->where( ['pid' => $pid] )->select();
        $b = array_column($array,'sort');
        array_multisort($b,SORT_DESC ,$array);
        if ($array != false) {
            $num = $level;
            foreach ($array as $key => $val) {
               if ($level >0 ) {
                   $level--;
                   $array[$key]['son'] = $this->generateTree($val['id'], $level);
                }
                if ($level < 2) {
                    $level = $num;
                }
            }
        }
        return $array;
    }
}

 

Array
(
    [0] => Array
        (
            [name] => 电器
            [pid] => 0
            [sort] => 1
            [id] => 27
            [son] => Array
                (
                    [0] => Array
                        (
                            [name] => 彩电
                            [pid] => 27
                            [sort] => 2
                            [id] => 28
                            [son] => Array
                                (
                                    [0] => Array
                                        (
                                            [name] => 海信
                                            [pid] => 28
                                            [sort] => 2
                                            [id] => 30
                                        )

                                    [1] => Array
                                        (
                                            [name] => 小米
                                            [pid] => 28
                                            [sort] => 1
                                            [id] => 31
                                        )

                                )

                        )

                    [1] => Array
                        (
                            [name] => 空调
                            [pid] => 27
                            [sort] => 1
                            [id] => 29
                            [son] => Array
                                (
                                )

                        )

                )

        )

)

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值