java递归返回树状图

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
package com.cmft.service.impl;
import java.util.ArrayList;
import java.util.List;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import com.cmft.dto.CompanyInfoDTO;
import com.cmft.mapper.RiskExposureInfoMapper;
import com.cmft.service.RiskExposureInfoService;
import com.cmft.utils.BeanMapper;
/**
* 递归查询树结构
*
* @author
* @date 2020年6月5日
*/
@Service
public class RiskExposureInfoServiceImpl implements RiskExposureInfoService {
@Autowired
private RiskExposureInfoMapper companyMapper;
@Autowired
private BeanMapper beanMapper;
@Override
public List<CompanyInfoDTO> getSubsidiary() {
// 获取第一层级（目录级别）
List<CompanyInfoDTO> dateList = beanMapper.mapList(companyMapper.getSubsidiary(), CompanyInfoDTO.class);
List<CompanyInfoDTO> list = new ArrayList<>();
for (CompanyInfoDTO cp : dateList) {
CompanyInfoDTO tree = getTree(cp);
if (tree != null) {
list.add(tree);
}
}
return list;
}
// 获取目录的叶子和子叶子
public CompanyInfoDTO getTree(CompanyInfoDTO c) {
List<CompanyInfoDTO> list =
beanMapper.mapList(companyMapper.getData(c.getCompanyCode()), CompanyInfoDTO.class); 获取叶子的数据
if (list != null) {// 判断是否还有子叶子
c.setChildlist(list);
for (CompanyInfoDTO cd : list) {
getTree(cd);// 递归找子叶子。。。。
}
}
return c;
}
}