/** * 递归循环分类 */ private function foreachd($arr, $id = 0, $level = 0) { if (!$arr) return $arr; $list = []; foreach ($arr as $k=>$v){ if ($v['parent_id'] == $id) { $v['level'] = $level; $v['children'] = $this->foreachd($arr, $v['id'], $level+1); $list[] = $v; } } return $list; }
php 递归模板
最新推荐文章于 2025-08-20 11:37:09 发布