thinkphp 递归树形结构数组无限下级

 $aa = Db::table("grade_agent")->where("bid","in",implode(',',$user_team_id))->field("bid,tid")->select();

$res=sotr($aa,$user["id"]);



function sotr($data,$pid=0,$level=0){

    $list =array();
    foreach ($data as $k=>$v){
        if ($v['tid'] == $pid){
            $v['level'] = $level;
            $v['son'] =sotr($data,$v['bid'],$level+1);

            $list[] = $v;
        }
    }
    return $list;

}

打印结果 

Array
(
    [0] => Array
        (
            [bid] => 147
            [tid] => 146
            [level] => 0
            [son] => Array
                (
                )

        )

    [1] => Array
        (
            [bid] => 148
            [tid] => 146
            [level] => 0
            [son] => Array
                (
                    [0] => Array
                        (
                            [bid] => 149
                            [tid] => 148
                            [level] => 1
                            [son] => Array
                                (
                                    [0] => Array
                                        (
                                            [bid] => 150
                                            [tid] => 149
                                            [level] => 2
                                            [son] => Array
                                                (
                                                    [0] => Array
                                                        (
                                                            [bid] => 153
                                                            [tid] => 150
                                                            [level] => 3
                                                            [son] => Array
                                                                (
                                                                )

                                                        )

                                                )

                                        )

                                )

                        )

                    [1] => Array
                        (
                            [bid] => 154
                            [tid] => 148
                            [level] => 1
                            [son] => Array
                                (
                                    [0] => Array
                                        (
                                            [bid] => 155
                                            [tid] => 154
                                            [level] => 2
                                            [son] => Array
                                                (
                                                )

                                        )

                                )

                        )

                    [2] => Array
                        (
                            [bid] => 156
                            [tid] => 148
                            [level] => 1
                            [son] => Array
                                (
                                )

                        )

                )

        )

    [2] => Array
        (
            [bid] => 151
            [tid] => 146
            [level] => 0
            [son] => Array
                (
                )

        )

    [3] => Array
        (
            [bid] => 152
            [tid] => 146
            [level] => 0
            [son] => Array
                (
                )

        )

)

 

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值