java递归 tree_java 实现递归实现tree

package app.util;

import java.util.ArrayList;

import java.util.List;

import com.alibaba.fastjson.JSON;public classMenu {privateInteger pid;privateString menuName;privateInteger parentId;privateInteger position;private List

}public voidsetPid(Integer pid) {this.pid =pid;

}publicString getMenuName() {returnmenuName;

}public voidsetMenuName(String menuName) {this.menuName =menuName;

}publicInteger getParentId() {returnparentId;

}public voidsetParentId(Integer parentId) {this.parentId =parentId;

}publicInteger getPosition() {returnposition;

}public voidsetPosition(Integer position) {this.position =position;

}public List

}public void setChildMenu(List

}publicMenu(Integer parentId,String menuName, Integer pid, Integer position) {

super();this.parentId =parentId;this.menuName =menuName;this.pid =pid;this.position =position;

}publicMenu() {

super();

}public static voidmain(String[] args) {

List

Menu menu1=new Menu(1, "父级1", 0, 1);

Menu menu2=new Menu(2, "父级2", 0, 2);

Menu menu1_1=new Menu(3, "子级1_1", 1, 1);

Menu menu1_2=new Menu(4, "子级1_2", 1, 2);

Menu menu1_2_1=new Menu(5, "子级1_2_1", 4, 2);

Menu menu1_2_2=new Menu(6, "子级1_2_2", 2, 2);

list.add(menu1);

list.add(menu2);

list.add(menu1_1);

list.add(menu1_2);

list.add(menu1_2_1);

list.add(menu1_2_2);

List

String trssJson=JSON.toJSONString(listTree);

System.out.println(trssJson);

}public static List

List

List

menu.setChildMenu(menuLists);

menus.add(menu);

}

}returnmenus;

}

}

/** * 根据等级查询类目树 * * @param level * @return */ @Override public List queryCategoryTree(Integer level) { //查询当前级别下类目 List list = categoryDAO.list(level); //组装好的类目树,返回前端 List categoryTree = new ArrayList(); //所有类目 List allDTOList = new ArrayList(); if (CollectionUtils.isEmpty(list)) { return categoryTree; } for (CategoryDO categoryDO : list) { allDTOList.add(new CategoryTreeDTO().convertDOToDTO(categoryDO)); } //当前等级类目 categoryTree = allDTOList.stream().filter(dto -> level.equals(dto.getLevel())).collect(Collectors.toList()); for (CategoryTreeDTO categoryTreeDTO : categoryTree) { //组装类目为树结构 assembleTree(categoryTreeDTO, allDTOList,Constants.CATEGORY_MAX_LEVEL - level); } return categoryTree; } /** * 组装树 * * @param categoryTreeDTO * @param allList * @param remainRecursionCount 剩余递归次数 * @return */ public CategoryTreeDTO assembleTree(CategoryTreeDTO categoryTreeDTO, List allList, int remainRecursionCount) { remainRecursionCount--; //最大递归次数不超过Constants.CATEGORY_MAX_LEVEL-level次,防止坏数据死循环 if(remainRecursionCount < 0){ return categoryTreeDTO; } String categoryCode = categoryTreeDTO.getCategoryCode(); Integer level = categoryTreeDTO.getLevel(); //到达最后等级树返回 if (Constants.CATEGORY_MAX_LEVEL == level) { return categoryTreeDTO; } //子类目 List child = allList.stream().filter(a -> categoryCode.equals(a.getParentCode())).collect(Collectors.toList()); if (null == child) { return categoryTreeDTO; } categoryTreeDTO.setChildren(child); //组装子类目 for (CategoryTreeDTO dto : child) { assembleTree(dto, allList,remainRecursionCount); } return categoryTreeDTO; }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值