php分类递归类,PHP无限分类(递归)

'1',

'name'=>'php技术',

'pid'=>'0',

'path'=>'0',

),

array(

'id'=>'2',

'name'=>'linux技术',

'pid'=>'0',

'path'=>'0',

),

array(

'id'=>'3',

'name'=>'Thinkphp',

'pid'=>'1',

'path'=>'0-1',

),

array(

'id'=>'4',

'name'=>'系统安装',

'pid'=>'2',

'path'=>'0-2',

),

array(

'id'=>'5',

'name'=>'文件上传',

'pid'=>'3',

'path'=>'0-1-3',

),

array(

'id'=>'6',

'name'=>'硬盘分区',

'pid'=>'4',

'path'=>'0-2-4',

),

array(

'id'=>'7',

'name'=>'软件安装',

'pid'=>'4',

'path'=>'0-2-4',

),

array(

'id'=>'8',

'name'=>'JAVA技术',

'pid'=>'0',

'path'=>'0',

),

array(

'id'=>'9',

'name'=>'分区格式化',

'pid'=>'4',

'path'=>'0-2-4-6',

),

array(

'id'=>'10',

'name'=>'JAVA基础',

'pid'=>'8',

'path'=>'0-8',

),

);

// 递归子级

function findchild(&$arr,$id){

$childs=array();

foreach ($arr as $key => $value) {

if($value['pid']==$id){

$childs[]=$value;

}

}

return $childs;

}

// 查找当前级别的子级

function build_tree($root_id){

global $rows;

$childs=findchild($rows,$root_id);

if(empty($childs)){

return null;

}

foreach ($childs as $key => $value) {

$rescurTree=build_tree($value['id']);

if(null != $rescurTree){

$childs[$key]['childs']=$rescurTree;

}

}

return $childs;

}

$trees=build_tree(0);

echo "";

print_r($trees);

echo "";

function show($trees){

$pre='';

$str='';

foreach ($trees as $tree) {

if($tree['pid']>0){

$pre='| '.str_repeat(' - ', substr_count($tree['path'],'-'));

}

$str.=$pre.$tree['name'].'

';

if(isset($tree['childs'])){

$str.=show($tree['childs']);

}

}

return $str;

}

echo show($trees);

?>

// $trees数组结构为

Array

(

[0] => Array

(

[id] => 1

[name] => php技术

[pid] => 0

[path] => 0

[childs] => Array

(

[0] => Array

(

[id] => 3

[name] => Thinkphp

[pid] => 1

[path] => 0-1

[childs] => Array

(

[0] => Array

(

[id] => 5

[name] => 文件上传

[pid] => 3

[path] => 0-1-3

)

)

)

)

)

[1] => Array

(

[id] => 2

[name] => linux技术

[pid] => 0

[path] => 0

[childs] => Array

(

[0] => Array

(

[id] => 4

[name] => 系统安装

[pid] => 2

[path] => 0-2

[childs] => Array

(

[0] => Array

(

[id] => 6

[name] => 硬盘分区

[pid] => 4

[path] => 0-2-4

)

[1] => Array

(

[id] => 7

[name] => 软件安装

[pid] => 4

[path] => 0-2-4

)

[2] => Array

(

[id] => 9

[name] => 分区格式化

[pid] => 4

[path] => 0-2-4-6

)

)

)

)

)

[2] => Array

(

[id] => 8

[name] => JAVA技术

[pid] => 0

[path] => 0

[childs] => Array

(

[0] => Array

(

[id] => 10

[name] => JAVA基础

[pid] => 8

[path] => 0-8

)

)

)

)

// $trees输出结果为

php技术

| - Thinkphp

| - - 文件上传

linux技术

| - 系统安装

| - - 硬盘分区

| - - 软件安装

| - - - 分区格式化

JAVA技术

| - JAVA基础

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值