java 递归查询树形结构

  CREATE TABLE "T_MB_PEAK_POWERTYPE"
   (	"TYPEID" NUMBER(4,0) NOT NULL ENABLE, 
	"TYPENAME" VARCHAR2(100 BYTE) NOT NULL ENABLE, 
	"UPTYPEID" NUMBER(4,0), 
	"TYPELEVEL" NUMBER(4,0) NOT NULL ENABLE, 
	"ORDERNO" NUMBER(4,0), 
	"DESCRIBE" VARCHAR2(255 BYTE), 
	"VALID" VARCHAR2(8 BYTE)

   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."TYPEID" IS '类别ID';
 
   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."TYPENAME" IS '类别名称';
 
   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."UPTYPEID" IS '父类别ID';
 
   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."TYPELEVEL" IS '类别级别';
 
   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."ORDERNO" IS '显示顺序';
 
   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."DESCRIBE" IS '注释信息';
 
   COMMENT ON COLUMN "BSP_HUABEI"."T_MB_PEAK_POWERTYPE"."VALID" IS '是否有效(Y有效N表示无效)';
    /**     * 查询树形结构     * @param id : 父id     */    @SuppressWarnings("unchecked")    public void iterative(int id){         String sql = "select typeid , typename , uptypeid , typelevel , orderno  from T_MB_PEAK_POWERTYPE where uptypeid = ? ";       List<HashMap<String , Object>> list = super.getJdbcTemplate().query(sql, new Object[]{id} ,new MyRowMapper()) ;      if(list!=null && list.size() >0){        for(HashMap<String , Object> map : list){          // 主键id          int typeid = TypeUtil.toInt(map.get("typeid"));          String typename = String.valueOf(map.get("typename"));          System.out.println(typename);          iterative(typeid);        }      }     }






/** * 根据等级查询类目树 * * @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、付费专栏及课程。

余额充值