java递归无限菜单_递归无限级树下拉菜单

本文通过Java代码展示了如何构建无限级树形菜单数据,包括递归函数`buildNode`用于生成子节点,以及查询所有菜单并构建树的`queryChannelList`方法。前端使用JavaScript实现树形菜单的展示,通过`buildNode`函数递归处理数据并动态生成菜单选项。
摘要由CSDN通过智能技术生成

1592c11312e8d17dfcd283679744b0d9.png

Java代码

/**

*树形菜单VO

*/

publicclassSelectTreeimplementsSerializable{

privateintid;

privateString name;

privateList child =newArrayList();

//getter & setter ....略

}

/**

*树形菜单VO

*/

public class SelectTree implements Serializable{

private int id;

private String name;

private List child = new ArrayList();

//getter & setter ....略

}

代码片段:

Java代码

/**

* 构建树型菜单数据

*/

publicList buildNode(intpid,List channels){

List result =newArrayList();

for(YcChannel chl:channels){

SelectTree node =newSelectTree();

if(null!= chl.getParentId() && chl.getParentId().equals(pid)){

node.setId(chl.getChannelId());

node.setName(chl.getName());

List children = buildNode(chl.getChannelId(),channels);

if(null!= children &&0

node.setChild(children);

}

result.add(node);

}

}

returnresult;

}

publicString queryChannelList() {

ycChannelList =this.channelSer.queryChannelList();

List trees =newArrayList();

for(YcChannel yc:ycChannelList){

if(null== yc.getParentId()){

SelectTree t =newSelectTree();

t.setId(yc.getChannelId());

t.setName(yc.getName());

t.setChild(buildNode(t.getId(),ycChannelList));

trees.add(t);

}

}

this.setAjaxData(trees);

returnAJAX_DATA;

}

/**

* 构建树型菜单数据

*/

public List buildNode(int pid,List channels){

List result = new ArrayList();

for(YcChannel chl:channels){

SelectTree node = new SelectTree();

if(null != chl.getParentId() && chl.getParentId().equals(pid)){

node.setId(chl.getChannelId());

node.setName(chl.getName());

List children = buildNode(chl.getChannelId(),channels);

if(null != children && 0 < children.size()){

node.setChild(children);

}

result.add(node);

}

}

return result;

}

public String queryChannelList() {

ycChannelList = this.channelSer.queryChannelList();

List trees = new ArrayList();

for(YcChannel yc:ycChannelList){

if(null == yc.getParentId()){

SelectTree t = new SelectTree();

t.setId(yc.getChannelId());

t.setName(yc.getName());

t.setChild(buildNode(t.getId(),ycChannelList));

trees.add(t);

}

}

this.setAjaxData(trees);

return AJAX_DATA;

}

前端JS代码:

Js代码

//recursive tree node

functionbuildNode(len,data){

varprefix ="|";

for(vari=0;i

prefix +="-";

}

$.each(data,function(i,item){

if(0 

$('#typeid').append(""+ prefix + item.name +"");

buildNode(len+1,item.child);

}else{

$('#typeid').append(""+ prefix + item.name +"");

}

});

}

$.ajax({

url:'${base}/channel/channelAction!queryChannelList.action',

type:'GET',

dataType:'json',

contentType:'application/json',

success:function(json){

if(json.success){

$('#typeid').empty();

$('#typeid').append("请选择栏目...");

$.each(json.data,function(i,item){

if(null== item.parentId){

$('#typeid').append(""+ item.name +"");

buildNode(1,item.child);

}

});

}

},

error:function(){

alert("加载栏目出错!");

}

});

});

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

余额充值