public static function buildTree($d, $r = 0, $pk = 'pid', $k = 'id', $c = 'sub',$multi = 0) {
$m = array();
$m[$r] = array();
foreach ($d as $e) {
isset($m[$e[$pk]]) ?: $m[$e[$pk]] = array();
isset($m[$e[$k]]) ?: $m[$e[$k]] = array();
$m[$e[$pk]][] = array_merge($e, array($c => &$m[$e[$k]]));
}
if ($multi == 1)
return $m[$r];
else
return $m[$r][0];
}
php 高效递归方法(树结构可使用)
最新推荐文章于 2022-04-20 13:34:52 发布