<?php
namespace app\common\service;
/**
* 树
* @author zzy
* @version $V1.0.0$
* @date 2018-09-26
*/
class Tree
{
/**
* 无限极分类
* @param $data 数据
* @param int $parent_id 父id
* @param int $level 等级
* @return array
*/
public function Trees($data, $parent_id = 0, $level = 1)
{
static $new_arr = [];
foreach ($data as $key => $value) {
if ($value['parent_id'] == $parent_id) {
$new_arr[] = $value;
$this->Trees($data, $value['bs_department_id'], $level + 1);
}
}
return $new_arr;
}
}
无限极分类
最新推荐文章于 2019-04-24 09:24:31 发布