摘要: 后端php无限极分类 $items = array(); foreach($res_arr as $v){ $items[$v['id']] = $v; } $tree = array(); foreach($items as $k => $item){ if(isset($items[$item[ 阅读全文
posted @ 2021-08-27 17:05 平常心wyp 阅读(50) 评论(0) 推荐(0) 编辑