以树状节点结构为例:
1.找到根节点,进入递归方法;
2.递归方法中首先找到当前传入节点的所有直接子节点,拼接到该节点的同级属性,例如set到children对象中;
3.然后遍历找到的子节点列表,进入下一次递归的条件是他们有子类;
Map<String,Object> map = new HashMap<>();
map.put("name","根节点 id");
recursiveFn(maps,map);
private void recursiveFn(List<Map<String, Object>> maps, Map<String,Object> map) {
// 得到子节点列表
List<Map<String, Object>> childList = getChildList(maps, map);
map.put("children",childList);
for (Map<String, Object> cl : childList) {
if (hasChild(maps, cl)) {
recursiveFn(maps, cl);
}
}
}
private List<Map<String, Object>> getChildList(List<Map<String, Object>> maps, Map<String, Object> map) {
List<Map<String, Object>> list = Lists.newArrayList();
for (Map<String, Object> m : maps) {
if(ObjectUtils.nullSafeEquals(m.get("prentNodeId"),map.get("name"))){
Map<String, Object> m1 = new HashMap<>();
m1.put("name",m.get("nodeId"));
list.add(m1);
}
}
return list;
}
private boolean hasChild(List<Map<String, Object>> maps, Map<String, Object> cl) {
return getChildList(maps, cl).size() > 0 ? true : false;
}