如何把这段代码做成无限循环?

浏览:349 发布日期:2020/02/27 分类:求助交流 关键字: tp6
面临一个无限分类的难题,在获取顶级分类以后,进行数组遍历,然后向下查询,如果存在子分类则继续查询、遍历。我知道这样写不科学,但是所掌握的知识比较少,求大神给个正确的设计思路。在此谢过了。
模型代码:    public static
    function get_list1()
    {
        $list = self::where('pid', 0)->select();

        foreach ($list as $value) {

            $son = self::where('pid', $value['tid'])->select();

            if (count($son)) {
                foreach ($son as $value1) {
                    $sun = self::where('pid', $value1['tid'])->select();
                    if (count($sun)) {
                        foreach ($sun as $value2) {
                            $con = self::where('pid', $value2['tid'])->select();
                            if (count($con)) {
                                foreach ($con as $value3) {
                                    $con2 = self::where('pid', $value3['tid'])->select();
                                    if ($con2) {
                                        foreach ($con2 as $value4) {
                                            $con3 = self::where('pid', $value4['tid'])->select();
                                            if ($con3) {
                                                $value4['level'] = 5;
                                                $value4['children'] = $con3;
                                            }
                                        }
                                        $value3['level'] = 4;
                                        $value3['children'] = $con2;
                                    }
                                }
                                $value2['level'] = 3;
                                $value2['children'] = $con;
                            }
                        }
                        $value1['level'] = 2;
                        $value1['children'] = $sun;
                    }
                }
                $value['level'] = 1;
                $value['children'] = $son;
            }


        }
        return json(['code' => 0, 'data' => $list]);


        // print_r($list);
    }
最佳答案
评论( 相关
后面还有条评论,点击查看>>