头大的冯冯

摘要： 1 //递归无限分类树 2 public static function diGui($data, $pid) 3 { 4 $arr = collect([]); 5 if (empty($data)) { 6 return ''; 7 } 8 9 foreach ($data as $key => $value) { 10 ... 阅读全文