如何用PHP编写一个无限制级深度的递归函数来生成分类目录结构
最编程
2024-07-21 13:45:45
...
<div class="menu_dropdown bk_2">
{foreach $nav as $k => $nav_one}
{foreach $nav_one['son'] as $kk=>$nav_two}
<dl id="menu{$kk}" class="sec_nav" data-pid="{$nav_one.id}" style="{if($nav_one.id == $current_auth_ids[1])}display:block;{else/}display:none;{/if}">
<dt class="{if($nav_two.id == $current_auth_ids[2])}selected{/if}"><i class="Hui-iconfont"></i> {$nav_two.auth_name}<i class="Hui-iconfont menu_dropdown-arrow"></i></dt>
<dd style="{if($nav_two.id == $current_auth_ids[2])}display:block;{/if}">
<ul>
{foreach $nav_two['son'] as $nav_three}
<li data-id="{$nav_three.id}" class="{if($nav_three.id == $current_auth_ids[3])}current{/if}">
<a href="{if($nav_three['auth_c']&&$nav_three['auth_a'])}{:url($nav_three['auth_c'] . '/' . $nav_three['auth_a'])}{else/}javascript:;{/if}" title="">{$nav_three.auth_name}</a>
</li>
{/foreach}
</ul>
</dd>
</dl>
{/foreach}
{/foreach}
</div>