java 递归 树状数据结构 部门

public ApiResult getDeptTree(String pid) {
        //根据id获取当前部门
        List<Map<String, Object>> deptList = deptMapper.getDeptById(pid);
        List<Map<String, Object>> deptReturn = deptList(deptList);
        return new ApiResult().success(deptReturn);
    }

    public List<Map<String,Object>> deptList(List<Map<String,Object>> deptList){
        List<Map<String,Object>> returnList = new ArrayList<>();
        if(deptList!=null && deptList.size()>0){
            for(Map<String,Object> map:deptList){
                //构造返回结果map
                map.put("children",getDeptChildList(map));
                returnList.add(map);
            }
        }
        return returnList;
    }

    public List<Map<String,Object>> getDeptChildList(Map<String,Object> dept){
        List<Map<String,Object>> returnList = new ArrayList<>();
        if(dept!=null ){
            //第二层结果
            List<Map<String, Object>> childDeptList = deptMapper.listDeptByPId(dept.get("id").toString(), "0");
            if(childDeptList!=null && childDeptList.size()>0){
                for(Map<String, Object> map : childDeptList){
                    map.put("child",getDeptChildList(map));
                    returnList.add(map);
                }

            }
        }
        return returnList;
    }

上述代码缺少一个isParentId的判断,另外ArrayList需要换成LinkedList,否则无序

 

 @Override
    public ApiResult testSelectMenuList() {
        List<CardMenu> menuList = menuMapper.testSelectMenuList();
        CardMenu cardMenu = null;
        // 找到父结构
        for(CardMenu menu : menuList){
            if(menu.getGuid().equals("c19cd8d1f3f0cb03ed0cfd9b92fe851b")){
                cardMenu = menu;
            }
        }
        this.addMenu(menuList ,cardMenu);
        return new ApiResult().success(cardMenu);
    }
    public CardMenu addMenu(List<CardMenu> menuList , CardMenu cardMenu){
        
        for(CardMenu menu : menuList){
            if(menu.getpId().equals(cardMenu.getGuid())){
                if(cardMenu.getMenuChildList() == null){
                    cardMenu.setMenuChildList(new ArrayList<CardMenu>());
                }
                cardMenu.getMenuChildList().add(addMenu(menuList, menu));
            }
        }
        return cardMenu;
    }

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
/** * 根据等级查询类目树 * * @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、付费专栏及课程。

余额充值