/** * 递归重组数组 * 二维数组中增加层级level * @param array $arrs * @param int $pid * @param int $level * @return array $lixt */ public static function category($arrs, $pid = 0, $level = 0) { static $list = array(); //新数组,存储child foreach ($arrs as $v) { if ($v['parent_id'] == $pid) { //说明找到,将其保存到tree数组中 $v['level'] = $level; $list[] = $v; //继续以当前节点为父节点,找它的子节点 Tools::category($arrs, $v['id'], ++$level); $level--; } } return $list; }