树结构数据补全路径信息

思路:

 1.先把要补全路劲的全部数据找出

2.递归列表,需要一个额外字段fakeId标识,每次找到列表中最末级的数据,把路径字段往前补全id,同时把fakeId字段赋值为上一级的id

3.每递归一次,把最末级的去掉,根据fakeId再补全路径

    @Override
    public void getOrgPath() {
        //java获取org全路径
        long startTime = System.currentTimeMillis();
        List<OrgDTO> all = orgMapper.getAll();
        long midTime = System.currentTimeMillis();
        log.info("查询耗时:" + (midTime - startTime) + "ms");

        List<OrgDTO> resultList = orgMapper.getAll();
        List<OrgDTO> dealedList = new ArrayList<>();

        List<OrgDTO> endList = fillPath(all, resultList, dealedList);
    }


    List<OrgDTO> fillPath(List<OrgDTO> all, List<OrgDTO> resultList, List<OrgDTO> dealedList) {
        if (resultList == null || resultList.isEmpty()) {
            return dealedList;
        }
        Map<String, List<OrgDTO>> collect = resultList.stream().collect(Collectors.groupingBy(OrgDTO::getZsporgid));
        //最末级数据
        List<OrgDTO> lastItemList = resultList.stream().filter(item -> !collect.containsKey(item.getPkId())).collect(Collectors.toList());
        Map<String, String> lastMap = lastItemList.stream().collect(Collectors.toMap(OrgEntity::getPkId, OrgEntity::getZsporgid));
        if (dealedList != null && !dealedList.isEmpty()) {
            for (OrgDTO orgEntity : dealedList) {
                if (lastMap.containsKey(orgEntity.getFakeId())) {
                    lastItemList.add(orgEntity);
                }
            }
        }
        for (OrgDTO orgDTO : lastItemList) {
            if (StringUtils.isEmpty(orgDTO.getFakeId())) {
                orgDTO.setOrgPath(orgDTO.getPkId());
                orgDTO.setFakeId(orgDTO.getZsporgid());
            } else {
                orgDTO.setOrgPath(orgDTO.getFakeId() + "," + orgDTO.getOrgPath());
                //如果是旧的deallist,需要赋值新的fakeId
                orgDTO.setFakeId(lastMap.get(orgDTO.getFakeId()));
            }
        }
        dealedList.addAll(lastItemList);
        //去重
        Map<String, OrgDTO> map = dealedList.stream().collect(Collectors.toMap(OrgDTO::getPkId, item -> item, (k1, k2) -> k1));
        dealedList = map.entrySet().stream().map(e -> e.getValue()).collect(Collectors.toList());
        resultList = all.stream().filter(item -> !map.containsKey(item.getPkId())).collect(Collectors.toList());
        if (resultList == null || resultList.isEmpty()) {
            return dealedList;
        } else {
            return fillPath(all, resultList, dealedList);
        }
    }

 

评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值