php 无限级分类函数
ar=array(0=>array(name=>食物,id=>1,pid=>0),
02 1=>array(name=>植物,id=>2,pid=>0),
03 3=>array(name=>白菜,id=>3,pid=>1),
04 4=>array(name=>树,id=>4,pid=>2),
05 5=>array(name=>苹果,id=>5,pid=>3),
06 6=>array(name=>松树,id=>6,pid=>4),
07 7=>array(name=>饮料,id=>7,pid=>1),
08 8=>array(name=>测试1,id=>8,pid=>7),
09 9=>array(name=>测试2,id=>9,pid=>8),
10 10=>array(name=>人民,id=>10,pid=>9),
11 11=>array(name=>小米,id=>11,pid=>0),
12 );
13
14 echo <table border="1" width="100%">;
15 tre($ar,0);
16 echo </table>;
17
18 function tre($tree,$id)
19 {
20 $str = ;
21 $strid = ;
22 foreach ($tree as $key => $item)
23 {
24 if ($item[pid] == $id) {
25 $i = 0;
26 $i = sonNum($tree,$item[id]);
27 if ($i == 1 || $i == 0) {
28 echo <tr><td>;
29 } else {
30 echo <tr><td rowspan=".$i.">;
31 }
32 //echo <tr><td>;
33 echo $item[name];
34 echo </td></tr>;
35 tre($tree,$item[id]);
36 }
37 }
38 //tre($tree,$strid);
39 }
40
41 function sonNum($tre,$sum,$totale=1)
42 {
43 foreach ($tre as $key => $value)
44 {
45 if ($value[pid] == $sum){
46 $totale += sonNum($tre,$value[id],1);
47 }
48 }
49 return $totale;
50 }
本文地址：http://www.phprm.com/frame/php1005025.html
转载随意，但请附上文章地址:-)