<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                合規國際互聯網加速 OSASE為企業客戶提供高速穩定SD-WAN國際加速解決方案。 廣告
                官方也有很多高手寫的無限極都可以試著學習學習 下面寫3種 ~~~ <?php /** * Created by PhpStorm. * Date: 16/9/14 * Time: 17:12 */ //這個是元數據,你可以從數據庫里面進行讀取并且不需要進行轉換 //因為代碼部分會進行遍歷處理 //-1用于后面的根目錄判斷 //你也可以修改為0并修改后面的 if ($v['pid'] >= 0) 為 if ($v['pid'] > 0) //數據庫id應該不會出現等于0的情況吧 $list[] = ['id' => 0, 'pid' => -1, 'name' => 'A@0']; $list[] = ['id' => 1, 'pid' => 0, 'name' => 'A@1']; $list[] = ['id' => 2, 'pid' => 0, 'name' => 'A@2']; $list[] = ['id' => 3, 'pid' => 2, 'name' => 'A@3']; $list[] = ['id' => 4, 'pid' => 3, 'name' => 'A@4']; $list[] = ['id' => 5, 'pid' => 0, 'name' => 'A@5']; $list[] = ['id' => 6, 'pid' => 1, 'name' => 'A@6']; //先初始化目錄 $return = [];//索引目錄 $parent='';//根目錄, //數組預處理,這里的$v['id']一定要唯一,不然可能會出現被覆蓋的情況 foreach ($list as $v) $return[$v['id']] = [ 'id' => $v['id'], 'name' => $v['name'], 'pid' => $v['pid'], 'child' => '', ]; //將每個目錄與父目錄進行拼接,并找到根目錄 //找到父路徑,這里沒有判斷 $return[$v['pid']]['child']是否存在, //TP5下或者在不存在的情況下可能會報錯,自己加一下 foreach ($return as $k => $v) { if ($v['pid'] >= 0) $return[$v['pid']]['child'][$v['id']] = &$return[$k]; else $parent = &$return[$k]; } //打印根目錄 var_export($parent); ~~~ 推薦一下[童學芬](http://www.oschina.net/code/snippet_173183_11767)同學 發布于 2013年01月01日 1時, 無限極分類方法 ~~~ <?php /** * 此方法由@Tonton 提供 * http://my.oschina.net/u/918697 * @date 2012-12-12 */ function genTree5($items) { foreach ($items as $item) $items[$item['pid']]['son'][$item['id']] = &$items[$item['id']]; return isset($items[0]['son']) ? $items[0]['son'] : array(); } /** * 將數據格式化成樹形結構 * @author Xuefen.Tong * @param array $items * @return array */ function genTree9($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' => '江西省'), 2 => array('id' => 2, 'pid' => 0, 'name' => '黑龍江省'), 3 => array('id' => 3, 'pid' => 1, 'name' => '南昌市'), 4 => array('id' => 4, 'pid' => 2, 'name' => '哈爾濱市'), 5 => array('id' => 5, 'pid' => 2, 'name' => '雞西市'), 6 => array('id' => 6, 'pid' => 4, 'name' => '香坊區'), 7 => array('id' => 7, 'pid' => 4, 'name' => '南崗區'), 8 => array('id' => 8, 'pid' => 6, 'name' => '和興路'), 9 => array('id' => 9, 'pid' => 7, 'name' => '西大直街'), 10 => array('id' => 10, 'pid' => 8, 'name' => '東北林業大學'), 11 => array('id' => 11, 'pid' => 9, 'name' => '哈爾濱工業大學'), 12 => array('id' => 12, 'pid' => 8, 'name' => '哈爾濱師范大學'), 13 => array('id' => 13, 'pid' => 1, 'name' => '贛州市'), 14 => array('id' => 14, 'pid' => 13, 'name' => '贛縣'), 15 => array('id' => 15, 'pid' => 13, 'name' => '于都縣'), 16 => array('id' => 16, 'pid' => 14, 'name' => '茅店鎮'), 17 => array('id' => 17, 'pid' => 14, 'name' => '大田鄉'), 18 => array('id' => 18, 'pid' => 16, 'name' => '義源村'), 19 => array('id' => 19, 'pid' => 16, 'name' => '上壩村'), ); echo "<pre>"; print_r(genTree5($items)); print_r(genTree9($items)); //后者輸出格式,前者類似,只是數組鍵值不一樣,不過不影響數據結構 /* Array ( [0] => Array ( [id] => 1 [pid] => 0 [name] => 江西省 [son] => Array ( [0] => Array ( [id] => 3 [pid] => 1 [name] => 南昌市 ) [1] => Array ( [id] => 13 [pid] => 1 [name] => 贛州市 [son] => Array ( [0] => Array ( [id] => 14 [pid] => 13 [name] => 贛縣 [son] => Array ( [0] => Array ( [id] => 16 [pid] => 14 [name] => 茅店鎮 [son] => Array ( [0] => Array ( [id] => 18 [pid] => 16 [name] => 義源村 ) [1] => Array ( [id] => 19 [pid] => 16 [name] => 上壩村 ) ) ) [1] => Array ( [id] => 17 [pid] => 14 [name] => 大田鄉 ) ) ) [1] => Array ( [id] => 15 [pid] => 13 [name] => 于都縣 ) ) ) ) ) [1] => Array ( [id] => 2 [pid] => 0 [name] => 黑龍江省 [son] => Array ( [0] => Array ( [id] => 4 [pid] => 2 [name] => 哈爾濱市 [son] => Array ( [0] => Array ( [id] => 6 [pid] => 4 [name] => 香坊區 [son] => Array ( [0] => Array ( [id] => 8 [pid] => 6 [name] => 和興路 [son] => Array ( [0] => Array ( [id] => 10 [pid] => 8 [name] => 東北林業大學 ) [1] => Array ( [id] => 12 [pid] => 8 [name] => 哈爾濱師范大學 ) ) ) ) ) [1] => Array ( [id] => 7 [pid] => 4 [name] => 南崗區 [son] => Array ( [0] => Array ( [id] => 9 [pid] => 7 [name] => 西大直街 [son] => Array ( [0] => Array ( [id] => 11 [pid] => 9 [name] => 哈爾濱工業大學 ) ) ) ) ) ) ) [1] => Array ( [id] => 5 [pid] => 2 [name] => 雞西市 ) ) ) )*/ ~~~
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看