java递归生成树结构(类似菜单)

在这里插入图片描述
上面是基本的树结构
下面是java代码生成这样的树的json代码
这里不包括展现,展现很简单

/***
	 * pid 父id
	 * allList 所有数据库查出来的list数据
	 */
	public List<Map<String,Object>> getChild(String pid , List<ModelStruc> allList){
	     //   List<UserMenu> childList = new LinkedList<>();
	        List<Map<String,Object>> childList = new ArrayList<>();//用于保存子节点的list
	        for(ModelStruc ms : allList){
	            if(pid.equals(ms.getPid())){//判断传入的父id是否等于自身的,如果是,就说明自己是子节点
	            //    childList.add(userMenu);
	                Map<String,Object> map = new HashMap<>();
	                map.put("id",ms.getId());
	                map.put("pId", ms.getPid());
	                map.put("name",ms.getName());
	              //  map.put("value",userMenu.getId());
	             //   map.put("showcheck",true);
	             //   map.put("checkstate",0);
	                map.put("hasChildren",false);
	              //  map.put("isexpand",true);
	              //  map.put("complete",true);
	                map.put("ChildNodes", new Object[]{});
	                childList.add(map); //加入子节点
	            }
	        }
	        for(Map<String,Object> map : childList){//遍历子节点,继续递归判断每个子节点是否还含有子节点
	            List<Map<String,Object>> tList = getChild(String.valueOf(map.get("id"))  , allList);
	            if(!tList.isEmpty()){
	                map.put("hasChildren",true);
	            }
	            map.put("ChildNodes" , tList);
	           // userMenu.setChildList(getChild(userMenu.getResourceCode() , allList));
	        }
	        return childList;
	    }

使用方式:

List<ModelStruc> list = dao.selectByCode2(modelCode,version);//
		List list2 = modelStrucService.getChild("null", list);//默认根节点pid是null
		String json = JSON.toJSONString(list2);
		System.out.println(json);

运行打印的结果:

[{
	"ChildNodes": [{
		"ChildNodes": [],
		"hasChildren": false,
		"name": "2",
		"pId": "1dffsdad",
		"id": "424636cf08c444db872b2d7cb313b796"
	}, {
		"ChildNodes": [{
			"ChildNodes": [],
			"hasChildren": false,
			"name": "4",
			"pId": "7d1f42499bc34f69a6c659bae64097ab",
			"id": "00fa5469a1a44a6e963a288340ce93ca"
		}, {
			"ChildNodes": [{
				"ChildNodes": [],
				"hasChildren": false,
				"name": "ne2",
				"pId": "e4b870a1e927466ea1d53c8d333563a1",
				"id": "79f06788494c4336a95558f44241224a"
			}, {
				"ChildNodes": [],
				"hasChildren": false,
				"name": "ne",
				"pId": "e4b870a1e927466ea1d53c8d333563a1",
				"id": "9a97ec2787cd4ec99018a29f65ec50bb"
			}],
			"hasChildren": true,
			"name": "5",
			"pId": "7d1f42499bc34f69a6c659bae64097ab",
			"id": "e4b870a1e927466ea1d53c8d333563a1"
		}],
		"hasChildren": true,
		"name": "3",
		"pId": "1dffsdad",
		"id": "7d1f42499bc34f69a6c659bae64097ab"
	}, {
		"ChildNodes": [],
		"hasChildren": false,
		"name": "1",
		"pId": "1dffsdad",
		"id": "7ea8863043a244ffb7986877ae7a1960"
	}],
	"hasChildren": true,
	"name": "POS模型",
	"pId": "null",
	"id": "1dffsdad"
}]

表中的数据:
在这里插入图片描述
ModelStruc部分数据

public class ModelStruc implements java.io.Serializable {
	/**ID*/
	private java.lang.String id;
	/**名称*/
	
	private java.lang.String name;
	/**排序*/
	private java.lang.String morder;
	/**父菜单ID*/
	private java.lang.String pid;
	/**图标ID*/
	private java.lang.String iconid;
	/**创建人id*/

	private java.lang.String createBy;
	/**创建人*/

	private java.lang.String createName;
	/**修改人id*/
	private java.lang.String updateBy;
	/**修改时间*/
	private java.util.Date updateDate;
	/**创建时间*/
	private java.util.Date createDate;
	/**修改人*/
	private java.lang.String updateName;
	/**模型代码*/
	private java.lang.String icode;
	
	private java.lang.String version;
	
	private List<ModelStruc> children;
	}
无限级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"; }
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值