java递归遍历目录树(上下层级关系)

本文介绍了如何使用Java Spring Boot的JPA进行数据查询,展示了一个递归查询部门层级结构的实现。在@Service类中,通过@Builder注解创建DepartmentList对象,并利用部门Dao查询所有父级为'root'的部门,然后递归获取其子部门。在执行过程中遇到错误,由于@Builder注解导致问题,移除该注解后问题解决。最终得到了一个完整的部门层级结构,例如公司的各个部门和科室。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

@EntityScan
@Data
@Builder
public class DepartmentList {
    private Integer id;
    private String name;
    private java.util.List<DepartmentList> child;
}
/**
 * @author gmy
 * @version 1.0
 * @date 2021/7/23 15:15
 */
@Service
@AllArgsConstructor
public class DepartmentServiceImpl {
    private final DepartmentDao departmentDao;


    public List<DepartmentList> getAllDepartment(){
        // 得到所有的根目录
        List<Department> root = departmentDao.queryAllByParentId("root");
        List<DepartmentList> departmentsAll=new ArrayList<>();
        //遍历得到所有根的id,即其下级的父级id
        for (int i = 0; i <root.size() ; i++) {
            DepartmentList departmentList = DepartmentList
                    .builder()
                    .name(root.get(i).getName())
                    .id(root.get(i).getId())
                    .build();
                List<DepartmentList> common = common(root.get(i).getId().toString());
                departmentList.setChild(common);
            departmentsAll.add(departmentList);
        }
        return departmentsAll;
    }

    //传入父级id,得到其下面的各级别
    public List<DepartmentList> common(String parentId){
        List<Department> departments = departmentDao.queryAllByParentId(parentId);
        List<DepartmentList> departmentsAll=new ArrayList<>();
        for (int i = 0; i <departments.size() ; i++) {
            DepartmentList departmentList = DepartmentList
                    .builder()
                    .name(departments.get(i).getName())
                    .id(departments.get(i).getId())
                    .build();
                List<DepartmentList> common = common(departments.get(i).getId().toString());
                departmentList.setChild(common);
            departmentsAll.add(departmentList);
        }
        return departmentsAll;
    }

}

结果为:

[
    {
        "id": 1,
        "name": "公司",
        "child": [
            {
                "id": 2,
                "name": "部门1",
                "child": [
                    {
                        "id": 4,
                        "name": "科室1",
                        "child": [
                            {
                                "id": 5,
                                "name": "员工1",
                                "child": []
                            }
                        ]
                    }
                ]
            },
            {
                "id": 3,
                "name": "部门2",
                "child": []
            }
        ]
    }
]

执行过程中出现过一个错误,如图所示

 查阅资料显示是有有参的构造方法,仔细找才发现加了@Builder注解,把@Builder注解去掉就行了

jpa数据表的注解写@Entity,否则报错,如下图所示

无限级树(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、付费专栏及课程。

余额充值