- 相關(guān)推薦
php無限分類方法講解
大家知道php無限分類方法嗎?在一些復(fù)雜的系統(tǒng)中，要求對信息欄目進(jìn)行無限級(jí)的分類，以增強(qiáng)系統(tǒng)的靈活性。那么PHP是如何實(shí)現(xiàn)無限級(jí)分類的呢?
一、遞歸方法
復(fù)制代碼 代碼如下:
$items = array(
array('id'=>1,'pid'=>0,'name'=>'一級(jí)11'),
array('id'=>2,'pid'=>0,'name'=>'一級(jí)12'),
array('id'=>3,'pid'=>1,'name'=>'二級(jí)21'),
array('id'=>4,'pid'=>3,'name'=>'三級(jí)31'),
array('id'=>5,'pid'=>1,'name'=>'二級(jí)22'),
array('id'=>6,'pid'=>3,'name'=>'三級(jí)32'),
array('id'=>7,'pid'=>6,'name'=>'四級(jí)41'),
);
$i = 0;
function formatTree($arr, $pid = 0){
$tree = array();
$temp = array();
global $i;
if($arr){
foreach($arr as $k=>$v){
if($v['pid'] == $pid){//
$temp = formatTree($arr, $v['id']);
$temp && $v['son'] = $temp;
$tree[] = $v;
}
}
}
return $tree;
}
print_r(formatTree($items));
二、非遞歸方法
復(fù)制代碼 代碼如下:
function genTree($items) {
$tree = array(); //格式化好的樹
foreach ($items as $item)
if (isset($items[$item['pid']])){
$items[$item['pid']]['son'][] = &$items[$item['id']];
}
else{
$tree[] = &$items[$item['id']];
}
return $tree;
}
$items = array(
1 => array('id' => 1, 'pid' => 0, 'name' => '一級(jí)11'),
2 => array('id' => 2, 'pid' => 1, 'name' => '二級(jí)21'),
3 => array('id' => 3, 'pid' => 1, 'name' => '二級(jí)23'),
4 => array('id' => 4, 'pid' => 9, 'name' => '三級(jí)31'),
5 => array('id' => 5, 'pid' => 4, 'name' => '四級(jí)43'),
6 => array('id' => 6, 'pid' => 9, 'name' => '三級(jí)32'),
7 => array('id' => 7, 'pid' => 4, 'name' => '四級(jí)41'),
8 => array('id' => 8, 'pid' => 4, 'name' => '四級(jí)42'),
9 => array('id' => 9, 'pid' => 1, 'name' => '二級(jí)25'),
10 => array('id' => 10, 'pid' => 11, 'name' => '二級(jí)22'),
11 => array('id' => 11, 'pid' => 0, 'name' => '一級(jí)12'),
12 => array('id' => 12, 'pid' => 11, 'name' => '二級(jí)24'),
13 => array('id' => 13, 'pid' => 4, 'name' => '四級(jí)44'),
14 => array('id' => 14, 'pid' => 1, 'name' => '二級(jí)26'),
15 => array('id' => 15, 'pid' => 8, 'name' => '五級(jí)51'),
16 => array('id' => 16, 'pid' => 8, 'name' => '五級(jí)52'),
17 => array('id' => 17, 'pid' => 8, 'name' => '五級(jí)53'),
18 => array('id' => 18, 'pid' => 16, 'name' => '六級(jí)64'),
);
print_r(genTree($items));
【php無限分類方法講解】相關(guān)文章：
PHP實(shí)現(xiàn)無限級(jí)分類的方法07-14
php兩種無限分類方法實(shí)例06-15
PHP常用魔術(shù)方法講解10-29
PHP學(xué)習(xí):Category類庫無限分類07-28
php+mysql實(shí)現(xiàn)無限分類實(shí)例詳解07-23
PHP無限分類(樹形類)的深入分析10-17
php實(shí)現(xiàn)無限級(jí)分類實(shí)現(xiàn)代碼07-03
PHP擴(kuò)展程序講解11-10