Java递归遍历部门信息,列表结构非树形结构

企业微信API,获取部门列表。

分析:

  1. 返回数据结构特点,只会提供直属父部门id,无递归链部门id,故采用递归算法

        {
           "errcode": 0,
           "errmsg": "ok",
           "department": [
               {
                   "id": 2,
                   "name": "广州研发中心",
                   "name_en": "RDGZ",
                   "parentid": 1,
                   "order": 10
               },
               {
                   "id": 3,
                   "name": "邮箱产品部",
                   "name_en": "mail",
                   "parentid": 2,
                   "order": 40
               }
           ]
        }
    
  2. 企业微信部门数据持久化到数据库后,具体遍历递归代码

    注意:该方法是一次查询企业下所有的部门信息后,在Java中进行数据处理,非通过部门PID多次查询数据库数据

        static List<Department> childDepartment = Lists.newArrayList();
    
        @Override
        public List<Department> recursiveDepartment(String corpId, Long departmentId) {
            childDepartment.clear();
            DepartmentQuery query = new DepartmentQuery();
            query.setCorpId(corpId);
            query.setDepartmentId(departmentId);
            query.setDel(Boolean.FALSE);
            Department department = departmentDao.find(query);
            if (ObjectUtils.isNotEmpty(department)) {
                childDepartment.add(department);
                DepartmentQuery query1 = new DepartmentQuery();
                query1.setCorpId(corpId);
                query1.setDel(Boolean.FALSE);
                List<Department> departmentList = departmentDao.selectAll(query1);
                if (ObjectUtils.isNotEmpty(departmentList)) {
                    treeDepartment(departmentList, department.getDepartmentId());
                }
            }
            return childDepartment;
        }
    
        public List<Department> treeDepartment(List<Department> departmentList, Long parentId) {
            for (Department department : departmentList) {
                if (parentId.equals(department.getParentid())) {
                    treeDepartment(departmentList, department.getDepartmentId());
                    childDepartment.add(department);
                }
            }
            return childDepartment;
        }
    
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值