递归实现无限级栏目的分类

<?php
/*
|---重庆
|----|--綦江区
|---------|--赶水镇
|----|--沙坪坝区
|---贵州
|----|--遵义市
|---------|--遵义县
|--------------|--南白镇
|----|--贵阳
|-------
根据地区的一个层级关系,将其保存于php数组中。其中parent的值为其父栏目的id
 */
$area = array(
array('id'=>1, 'name'=>'重庆', 'parent'=>0),
array('id'=>2, 'name'=>'綦江区', 'parent'=>1),
array('id'=>3, 'name'=>'赶水镇', 'parent'=>2),
array('id'=>4, 'name'=>'贵州', 'parent'=>0),
array('id'=>5, 'name'=>'遵义市', 'parent'=>4),
array('id'=>6, 'name'=>'遵义县', 'parent'=>5),
array('id'=>7, 'name'=>'南白镇', 'parent'=>6),
array('id'=>8, 'name'=>'贵阳', 'parent'=>4),
array('id'=>9, 'name'=>'沙坪坝区', 'parent'=>1)
);
?>
 
 

查找子栏目

对于上面这样一个地区的分类。根据传入的当前栏目的id,查找此栏目下第一级子栏目。

<?php
function findSon($arr, $id = 0)
{
    //id栏目的子栏目有哪些呢?
    //answer:数组循环一遍,谁的parent值等于id, 谁就是他的子栏目
    $sons = array();   //子栏目组

    foreach ($arr as $val)
    {
        if ($val['parent'] == $id)
        {
            $sons[] = $val;
        }
    }
    return $sons;
}
echo '<pre>';
print_r(findSon($area, 1));    //查找重庆的子栏目(id为1)
echo '</pre>'; 
?> 
显示结果:


查找子孙树

将一个父栏目下所有大小栏目都相继给找出来

<?php
function subTree($arr, $id = 0, $lev = 1)
{
    static $subs = array();

    foreach ($arr as $val)
    {
        if ($val['parent'] == $id)
        {
            $val['lev'] = $lev;
            $subs[] = $val;
            //或删掉static $subs = array_merge($subs, subTree($arr, $val['id'], $lev+1));
            subTree($arr, $val['id'], $lev+2);  //此处就要递归调用了  
        }
    }
    return $subs;
}

$tree = subTree($area);  //打印整个栏目情况
foreach ($tree as $val)
{
    echo str_repeat('  ', $val['lev']), $val['name'], '<br />';
}
?> 
在浏览器中的显示结果为:

查找家谱树

给定一个栏目,将相应的父级的大小栏目找出

function familyTree($arr, $id)
{
    static $tree = array();
    foreach ($arr as $val)
    {  
        if ($val['id'] == $id)
        {
            //$tree[] = $val;
            if ($val['parent'] > 0)   //如果到了最顶层的家谱树,其id为0
            {
                //删掉static $tree = array_merge($tree, familyTree($arr, $val['parent']));
                familyTree($arr, $val['parent']);
            }
            $tree[] = $val;
            break;  //找到了就结束foreach循环.因为一个子栏目的父栏目一般只有一个,所以找到了,就结束foreach循环
        }
    }   
    return $tree;
}
echo '<pre>';
print_r(familyTree($area, 7));  //寻找id为7,栏目为“南白镇”的父栏目
echo '</pre>';
?> 
结果为:

总结看来,无限级分类也不是很难!


  • 1
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
无限树(Java递归) 2007-02-08 10:26 这几天,用java写了一个无限极的树,递归写的,可能代码不够简洁,性能不够好,不过也算是练习,这几天再不断改进。前面几个小图标的判断,搞死我了。 package com.nickol.servlet; import java.io.IOException; import java.io.PrintWriter; import java.sql.Connection; import java.sql.PreparedStatement; import java.sql.ResultSet; import java.util.ArrayList; import javax.servlet.ServletException; import javax.servlet.http.HttpServlet; import javax.servlet.http.HttpServletRequest; import javax.servlet.http.HttpServletResponse; import com.nickol.utility.DB; public class category extends HttpServlet { /** * The doGet method of the servlet. * * This method is called when a form has its tag value method equals to get. * * @param request the request send by the client to the server * @param response the response send by the server to the client * @throws ServletException if an error occurred * @throws IOException if an error occurred */ public void doGet(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException { response.setCharacterEncoding("utf-8"); response.setContentType("text/html"); PrintWriter out = response.getWriter(); out .println(""); out.println(""); out.println(" Category" + "" + "body{font-size:12px;}" + "" + "" + ""); out.println(" "); out.println(showCategory(0,0,new ArrayList(),"0")); out.println(" "); out.println(""); out.flush(); out.close(); } public String showCategory(int i,int n,ArrayList frontIcon,String countCurrent){ int countChild = 0; n++; String webContent = new String(); ArrayList temp = new ArrayList(); try{ Connection conn = DB.GetConn(); PreparedStatement ps = DB.GetPs("select * from category where pid = ?", conn); ps.setInt(1, i); ResultSet rs = DB.GetRs(ps); if(n==1){ if(rs.next()){ webContent += "";//插入结尾的减号 temp.add(new Integer(0)); } webContent += " ";//插入站点图标 webContent += rs.getString("cname"); webContent += "\n"; webContent += showCategory(Integer.parseInt(rs.getString("cid")),n,temp,"0"); } if(n==2){ webContent += "\n"; }else{ webContent += "\n"; } while(rs.next()){ for(int k=0;k<frontIcon.size();k++){ int iconStatic = ((Integer)frontIcon.get(k)).intValue(); if(iconStatic == 0){ webContent += "";//插入空白 }else if(iconStatic == 1){ webContent += "";//插入竖线 } } if(rs.isLast()){ if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += "";//插入结尾的减号 temp = (ArrayList)frontIcon.clone(); temp.add(new Integer(0)); }else{ webContent += "";//插入结尾的直角 } }else{ if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += "";//插入未结尾的减号 temp = (ArrayList)frontIcon.clone(); temp.add(new Integer(1)); }else{ webContent += "";//插入三叉线 } } if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += " ";//插入文件夹图标 }else{ webContent += " ";//插入文件图标 } webContent += rs.getString("cname"); webContent += "\n"; webContent += showCategory(Integer.parseInt(rs.getString("cid")),n,temp,countCurrent+countChild); countChild++; } webContent += "\n"; DB.CloseRs(rs); DB.ClosePs(ps); DB.CloseConn(conn); }catch(Exception e){ e.printStackTrace(); } return webContent; } public boolean checkChild(int i){ boolean child = false; try{ Connection conn = DB.GetConn(); PreparedStatement ps = DB.GetPs("select * from category where pid = ?", conn); ps.setInt(1, i); ResultSet rs = DB.GetRs(ps); if(rs.next()){ child = true; } DB.CloseRs(rs); DB.ClosePs(ps); DB.CloseConn(conn); }catch(Exception e){ e.printStackTrace(); } return child; } } --------------------------------------------------------------------- tree.js文件 function changeState(countCurrent,countChild){ var object = document.getElementById("level" + countCurrent + countChild); if(object.style.display=='none'){ object.style.display='block'; }else{ object.style.display='none'; } var cursor = document.getElementById("cursor" + countCurrent + countChild); if(cursor.src.indexOf("images/tree_minus.gif")>=0) {cursor.src="images/tree_plus.gif";} else if(cursor.src.indexOf("images/tree_minusbottom.gif")>=0) {cursor.src="images/tree_plusbottom.gif";} else if(cursor.src.indexOf("images/tree_plus.gif")>=0) {cursor.src="images/tree_minus.gif";} else {cursor.src="images/tree_minusbottom.gif";} var folder = document.getElementById("folder" + countCurrent + countChild); if(folder.src.indexOf("images/icon_folder_channel_normal.gif")>=0){ folder.src = "images/icon_folder_channel_open.gif"; }else{ folder.src = "images/icon_folder_channel_normal.gif"; }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值