java 数据查询组装树状图结构-数据库查询

查询数据库组装成树状结构数据(学习笔记)

数据库
careate table category{
id int PRIMARY KEY COMMENT '主键',
level int COMMENT '等级',
category_name varchar(7) COMMENT '类目名',
parent_id int COMMENT '父节点id',
parent_name varchar(7) COMMENT '父节点名'
}
Sql语句
sql 语句
select id,name,level from category where level=? or parent_id=?

//select * from category where parent_id=?

实体类(bean层)

//bean
public class Category{
 private int id;
 private String categoryName;
 private int  parentId;
 private String parentName;
 private int level;
 private List<Category> nodes=new ArrayList<>();
 //get ,set方法省略
}

mapper

interface CategoryMapper{

//调用sql select id,name,level from category where level=? or parent_id=?
//查询id,name,level
List<Category> findAll(Category category);

}

service层

public List<Category> treeSelect(Category category){
@Resource
private CategoryMapper categoryMapper;
//调用
 List<Category> categoryList=categoryMapper.findAll(categoryNew);
// List<Category> mapList = new ArrayList<>();
 Category categoryLists=null;
 
 for(int i=0;i<categoryList.size();i++){
 Category categoryTemporary=new Category();
 //Category categoryLists=null;
 categoryTemporary.setParentId(categoryList.getId);
 List<Category> list=treeSelect(categoryTemporary);
 categoryLists=categoryList.get(i);
 categoryLists.setNodes(list);
 //mapList.add(categoryLists);
 }
 
//retrun mapList;
retrun categoryLists;
}
public static List<Category> findAll(){
Category categoryNew=new Category();
categoryNew.setLevel(1);//最顶端的
List<Category> list=treeSelect(category);
retrun list;
}

测试 模拟控制层

//测试
public static void main (String args[]){
List<Category> list=findAll();
}

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
/** * 根据等级查询类目树 * * @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; }
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值