级联选择

获取树
 List<DepList> treeList = new ArrayList<>();
 List<DepList> originalList = baseMapper.getDepList();
        for (DepList d : originalList) {
            if (d.getParentId() == 0 && ids.contains(d.getId())) {
                treeList.add(getChildrenWithRole(d, originalList, ids));
            }
        }

递归

  private DepList getChildrenWithRole(DepList dep, List<DepList> originalList, Set<Long> ids) {
        for (DepList p : originalList) {
            if (p.getParentId().equals(dep.getId()) && ids.contains(p.getId())) {
                if (Objects.isNull(dep.getChildren())) {
                    dep.setChildren(new LinkedList<>());
                }
                dep.getChildren().add(getChildrenWithRole(p, originalList, ids));
            }
        }
        return dep;
    }

对子集遍历,插入人员信息

 for (DepList dept : treeList) {
                    getTreeUserData(dept);
                }

递归

    private void getTreeUserData(DepList dept) {
        List<DepList> deptUser = userDepartmentService.getDepListByDeptId(dept.getId());
        List<DepList> t = dept.getChildren();
        if (CollectionUtils.isNotEmpty(t)) {
            for (DepList t1 : t) {
                getTreeUserData(t1);
            }
            t.addAll(deptUser);
        } else {
            dept.setChildren(deptUser);
        }
    }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值