//递归无限极分类 public function getTree($data=[],$pid=0,$level=0) { $data = $this->select(); static $tree = []; foreach ($data as $value) { if($pid == $value['pid']) { $value['level'] = $level; $value['html'] = str_repeat('╍-',$level); $tree[] = $value; $this->getTree($data,$value['id'],$level+1); } } return $tree; }
转载于:https://my.oschina.net/u/3483680/blog/1822856