``` /** * $list 為查詢 出來的二維數組 **/ public function getTree($list,$pid=0,$itemprefix = '') { static $icon = array('│', '├', '└'); static $nbsp = " "; static $arr = array(); $number = 1; foreach($list as $row) { if($row['pid'] == $pid) { $brotherCount = 0; //判斷當前有多少個兄弟分類 foreach($list as $r) { if($row['pid'] == $r['pid']) { $brotherCount++; } } if($brotherCount >0) { $j = $k = ''; if($number == $brotherCount) { $j .= $icon[2]; $k = $itemprefix ? $nbsp : ''; }else{ $j .= $icon[1]; $k = $itemprefix ? $icon[0] : ''; } $spacer = $itemprefix ? $itemprefix . $j : ''; $row['name'] = $spacer.$row['name']; $arr[] = $row; $number++; $this->getTree($list,$row['id'],$itemprefix . $k . $nbsp); } } } return $arr; } ``` ## 樹形結構 ~~~ function listTreeIntelligence($list, $pk='id', $pid = 'pid', $child = 'child', $root = 0) { // 創建Tree $tree = array(); if (is_array($list)) { //創建基于主鍵的數組引用 $refer = array(); foreach ($list as $key => $data) { $refer[$data[$pk]] = &$list[$key]; } $ids = array_map(function($item) use($pk){ return $item[$pk]; },$list); foreach ($list as $key => $data) { // 判斷是否存在parent $parantId = $data[$pid]; if ($root == $parantId || !in_array($parantId, $ids)) { $tree[] = &$list[$key]; } else { if (isset($refer[$parantId])) { $parent = &$refer[$parantId]; $parent[$child][] = &$list[$key]; } } } } return $tree; } ~~~