Home >Backend Development >PHP Tutorial >PHP infinite classification function_PHP tutorial
ar=array(0=>array('name'=>'food','id' =>1,'pid'=>0),
02 1=>array('name'=>'Plant','id'=>2,'pid'=> ;0),
03 3=>array('name'=>'白菜','id'=>3,'pid'=>1),
" =>'Apple','id'=>5,'pid'=>3),
06 6=>array('name'=>'Pine','id' =>6,'pid'=>4),
07 7=>array('name'=>'Drink','id'=>7,'pid'=> ;1),
08 8=>array('name'=>'Test 1','id'=>8,'pid'=>7),
09 9=>array('name'=>'Test 2','id'=>9,'pid'=>8),
10 10=>array(' name'=>'People','id'=>10,'pid'=>9),
11 11=>array('name'=>'Xiaomi',' id'=>11,'pid'=>0),
12 );
13
14 echo '
22 foreach ($tree as $key => $item) 23 { 24 if ($item['pid'] == $id) {
25 $i = 0; 🎜>27 i == 0) { 28 td rowspan="'.$i.'">';
31 }
32 //echo '
33 echo $item['name'];
34 echo '
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 }