您好,登錄后才能下訂單哦!
這篇文章主要介紹php如何實(shí)現(xiàn)菜單/評(píng)論數(shù)據(jù)遞歸分級(jí)算法,文中介紹的非常詳細(xì),具有一定的參考價(jià)值,感興趣的小伙伴們一定要看完!
在開(kāi)發(fā)過(guò)程中經(jīng)常會(huì)遇到分級(jí)場(chǎng)景,如菜單分級(jí)、評(píng)論、商品類型分級(jí)等;在同一張mysql數(shù)據(jù)表中可能設(shè)計(jì)單表結(jié)構(gòu),如同如下數(shù)據(jù):
$menuList = [ [ 'id' => 1,'parent_id' => 0, 'name' => '節(jié)點(diǎn)1'], [ 'id' => 2,'parent_id' => 1, 'name' => '節(jié)點(diǎn)1-1'], [ 'id' => 3,'parent_id' => 0, 'name' => '節(jié)點(diǎn)2'], [ 'id' => 4,'parent_id' => 3, 'name' => '節(jié)點(diǎn)2-1'], [ 'id' => 5,'parent_id' => 2, 'name' => '節(jié)點(diǎn)1-1-1'], [ 'id' => 6,'parent_id' => 1, 'name' => '節(jié)點(diǎn)1-2'], ];
這時(shí)候在處理展示過(guò)程就需要將上面的結(jié)構(gòu)轉(zhuǎn)換為更加直觀的數(shù)據(jù)結(jié)構(gòu), 形如:
$treeList = [ [ children: [ children: [] ] ] [, children: [ children: [] ] ] ];
算法代碼如下:
<?php class Menu { /** * 遞歸循環(huán)菜單列表, 轉(zhuǎn)化為菜單樹(shù) * @param $treeList 菜單樹(shù)列表 * @param $menuList 菜單列表 * @return bool */ public function getMenuTree(&$treeList, $menuList) { // 初始化頂級(jí)父節(jié)點(diǎn) if (! count($treeList)) { foreach($menuList as $index => $menu) { if ($menu['parent_id'] == 0) { $treeList[] = $menu; unset($menuList[$index]); } } } // 遞歸查找子節(jié)點(diǎn) foreach ($treeList as &$tree) { foreach ($menuList as $index => $menu) { if (empty($tree['children'])) { $tree['children'] = []; } if ($menu['parent_id'] == $tree['id']) { $tree['children'][] = $menu; unset($menuList[$index]); } } if (! empty($tree['children'])) { $this->getMenuTree($tree['children'], $menuList); } else { // 遞歸臨界點(diǎn) return false; } } } } $menuList = [ [ 'id' => 1,'parent_id' => 0, 'name' => '節(jié)點(diǎn)1'], [ 'id' => 2,'parent_id' => 1, 'name' => '節(jié)點(diǎn)1-1'], [ 'id' => 3,'parent_id' => 0, 'name' => '節(jié)點(diǎn)2'], [ 'id' => 4,'parent_id' => 3, 'name' => '節(jié)點(diǎn)2-1'], [ 'id' => 5,'parent_id' => 2, 'name' => '節(jié)點(diǎn)1-1-1'], [ 'id' => 6,'parent_id' => 1, 'name' => '節(jié)點(diǎn)1-2'], ]; $treeList = []; (new Menu)->getMenuTree($treeList, $menuList); print_r($treeList);
以上是“php如何實(shí)現(xiàn)菜單/評(píng)論數(shù)據(jù)遞歸分級(jí)算法”這篇文章的所有內(nèi)容,感謝各位的閱讀!希望分享的內(nèi)容對(duì)大家有幫助,更多相關(guān)知識(shí),歡迎關(guān)注億速云行業(yè)資訊頻道!
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。