java递归实现多级菜单栏_Java 实现菜单递归

一、前言

最近在写一个博客的项目,菜单页面需要递归实现。

天天写crud递归都忘了咋写。一边百度一边好不容易写完了。

在此记录一下。

表结构:

create table sys_menu

(

menu_id bigint auto_increment comment '菜单ID'

primary key,

menu_name varchar(50) not null comment '菜单名称',

parent_id bigint default 0 null comment '父菜单ID',

order_num int(4) default 0 null comment '显示顺序',

url varchar(200) default '#' null comment '请求地址',

target varchar(20) default '' null comment '打开方式(menuItem页签 menuBlank新窗口)',

menu_type char default '' null comment '菜单类型(M目录 C菜单 F按钮)',

visible char default '0' null comment '菜单状态(0显示 1隐藏)',

perms varchar(100) null comment '权限标识',

icon varchar(100) default '#' null comment '菜单图标',

is_deleted varchar(1) default '0' null comment '删除状态(0显示 1删除)',

create_by varchar(64) default '' null comment '创建者',

create_time datetime null comment '创建时间',

update_by varchar(64) default '' null comment '更新者',

update_time datetime null comment '更新时间',

remark varchar(500) default '' null comment '备注'

)

comment '菜单权限表';

二、 实现思路

遍历所有菜单,把parentId字段为0添加到父集合中。

遍历父菜单集合,调用方法getChildList(allList, menuId)。

getChildList(allList, menuId) 遍历所有parentId等于menuId添加到子集合中。遍历子集合调用getChildList(allList, menuId) 方法。

三、 具体代码

public List selectMenusByUser(SysUser user) {

List menuList = menuMapper.selectMenusByUserId(user.getUserId());

return getChildPerms(menuList);

}

private List getChildPerms(List allMenuList) {

List rootList = new ArrayList<>();

for (Iterator lt = allMenuList.iterator(); lt.hasNext(); ) {

SysMenu menu = lt.next();

if (menu.getParentId() == 0) {

rootList.add(menu);

lt.remove();

}

}

for (SysMenu menu : rootList) {

menu.setChildren(getChild(allMenuList, menu.getMenuId()));

}

return rootList;

}

private List getChild(List allMenuList, Long id) {

List childList = new ArrayList<>();

for (Iterator lt = allMenuList.iterator(); lt.hasNext(); ) {

SysMenu menu = lt.next();

if (menu.getParentId().equals(id)) {

childList.add(menu);

lt.remove();

}

}

for (SysMenu menu : childList) {

menu.setChildren(getChild(allMenuList, menu.getMenuId()));

}

return childList;

}

四、 总结

代码一看就会,用的时候就是想不起来。

代码很简单,最基本的递归。

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 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、付费专栏及课程。

余额充值