<pre id="bbfd9"><del id="bbfd9"><dfn id="bbfd9"></dfn></del></pre>

          <ruby id="bbfd9"></ruby><p id="bbfd9"><mark id="bbfd9"></mark></p>

          <p id="bbfd9"></p>

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

            <th id="bbfd9"><form id="bbfd9"><dl id="bbfd9"></dl></form></th>

            <p id="bbfd9"><cite id="bbfd9"></cite></p><p id="bbfd9"></p>
            <p id="bbfd9"><cite id="bbfd9"><progress id="bbfd9"></progress></cite></p>

            php無限分類方法講解

            時間:2025-12-13 14:25:07 php語言 我要投稿

            php無限分類方法講解

              大家知道php無限分類方法嗎?在一些復雜的系統中,要求對信息欄目進行無限級的分類,以增強系統的靈活性。那么PHP是如何實現無限級分類的呢?

              一、遞歸方法

              復制代碼 代碼如下:

              $items = array(

              array('id'=>1,'pid'=>0,'name'=>'一級11'),

              array('id'=>2,'pid'=>0,'name'=>'一級12'),

              array('id'=>3,'pid'=>1,'name'=>'二級21'),

              array('id'=>4,'pid'=>3,'name'=>'三級31'),

              array('id'=>5,'pid'=>1,'name'=>'二級22'),

              array('id'=>6,'pid'=>3,'name'=>'三級32'),

              array('id'=>7,'pid'=>6,'name'=>'四級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){/pic/p>

              $temp = formatTree($arr, $v['id']);

              $temp && $v['son'] = $temp;

              $tree[] = $v;

              }

              }

              }

              return $tree;

              }

              print_r(formatTree($items));

              二、非遞歸方法

              復制代碼 代碼如下:

              function genTree($items) {

              $tree = array(); /pic/p>

              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' => '一級11'),

              2 => array('id' => 2, 'pid' => 1, 'name' => '二級21'),

              3 => array('id' => 3, 'pid' => 1, 'name' => '二級23'),

              4 => array('id' => 4, 'pid' => 9, 'name' => '三級31'),

              5 => array('id' => 5, 'pid' => 4, 'name' => '四級43'),

              6 => array('id' => 6, 'pid' => 9, 'name' => '三級32'),

              7 => array('id' => 7, 'pid' => 4, 'name' => '四級41'),

              8 => array('id' => 8, 'pid' => 4, 'name' => '四級42'),

              9 => array('id' => 9, 'pid' => 1, 'name' => '二級25'),

              10 => array('id' => 10, 'pid' => 11, 'name' => '二級22'),

              11 => array('id' => 11, 'pid' => 0, 'name' => '一級12'),

              12 => array('id' => 12, 'pid' => 11, 'name' => '二級24'),

              13 => array('id' => 13, 'pid' => 4, 'name' => '四級44'),

              14 => array('id' => 14, 'pid' => 1, 'name' => '二級26'),

              15 => array('id' => 15, 'pid' => 8, 'name' => '五級51'),

              16 => array('id' => 16, 'pid' => 8, 'name' => '五級52'),

              17 => array('id' => 17, 'pid' => 8, 'name' => '五級53'),

              18 => array('id' => 18, 'pid' => 16, 'name' => '六級64'),

              );

              print_r(genTree($items));

            【php無限分類方法講解】相關文章:

            PHP實現無限級分類的方法10-12

            php兩種無限分類方法實例12-08

            PHP學習:Category類庫無限分類03-21

            PHP常用魔術方法講解03-17

            php+mysql實現無限分類實例詳解09-11

            PHP無限分類(樹形類)的深入分析11-04

            php實現無限級分類實現代碼10-05

            PHP擴展程序講解12-10

            PHP網絡操作函數講解03-06

            • 相關推薦

                    <pre id="bbfd9"><del id="bbfd9"><dfn id="bbfd9"></dfn></del></pre>

                    <ruby id="bbfd9"></ruby><p id="bbfd9"><mark id="bbfd9"></mark></p>

                    <p id="bbfd9"></p>

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

                      <th id="bbfd9"><form id="bbfd9"><dl id="bbfd9"></dl></form></th>

                      <p id="bbfd9"><cite id="bbfd9"></cite></p><p id="bbfd9"></p>
                      <p id="bbfd9"><cite id="bbfd9"><progress id="bbfd9"></progress></cite></p>
                      飘沙影院