zoukankan      html  css  js  c++  java
  • java向下递归,构造树形结构

    代码逻辑如下:

    //xxx组织机构树形列表方法
    public List<Organization> xxxTreeOrg(xxx xx){
       //所有的组织机构list
      List<Organization> allOrganizationList = xxxDao.findAllOrgList();
    
       //所有一级组织机构List
      List<Organization> oneOrganizationList = xxxDao.findOneOrgList();
    
      for (Organization oneOrganization : oneOrganizationList) {
          oneOrganization.setChild(doOrgIterator(oneOrganization, allOrganizationList));
      }

      return oneOrganizationList; }
    //向下递归的方法 private List<Organization> doOrgIterator(Organization oneOrganization, List<Organization> allOrganizationList) {   List<Organization> childList = new ArrayList<>();   for (Organization organization : allOrganizationList) {   if(oneOrganization.getId().intValue() == organization.getPid().intValue()) {     organization.setChild(doOrgIterator(organization, allOrganizationList));     childList.add(organization);    }   }   return childList; }
  • 相关阅读:
    Python推导式(Comprehension)
    mysql中文乱码
    入门学习hibernate
    什么是ORM?
    Java网站中的权限管理
    Java的8中基本数据类型
    Python获取文件夹大小
    Python技巧
    Python中取整的方法floor,ceil,round
    Python线程join和setDaemon
  • 原文地址:https://www.cnblogs.com/supiaopiao/p/13220826.html
Copyright © 2011-2022 走看看