Java递归树应用
树数据结构
@Data
public class SelectTree {
private Integer id;
private String label;
private Integer parentId;
@JsonInclude(JsonInclude.Include.NON_EMPTY)
private List<SelectTree> children;
}
1.递归生成树
private List<SelectTree> createTree(int pid, List<SelectTree> trees) {
List<SelectTree> treeList = new ArrayList<>();
for (SelectTree tree : trees) {
if (pid == tree.getParentId()) {
treeList.add(tree);
tree.setChildren(this.createTree(tree.getId(), trees));
}
}
return treeList;
}
2.找出树所有分支最顶层节点集合
public static LinkedList<Long> findNodes(TreeFile node) {
LinkedList<Long> ids = new LinkedList<>();
if (StringUtils.isEmpty(node.getChildren())) {
ids.add(node.getWjFileId());
} else {
for (TreeFile child : node.getChildren()) {
ids.addAll(findNodes(child));
}
}
return ids;
}
数据平均分配
public static <T> List<List<T>> averageAssign(List<T> source, int n) {
List<List<T>> result = new ArrayList<>();
int remainder = source.size() % n;
int number = source.size() / n;
int offset = 0;
for (int i = 0; i < n; i++) {
List<T> value;
if (remainder > 0) {
value = source.subList(i * number + offset, (i + 1) * number + offset + 1);
remainder--;
offset++;
} else {
value = source.subList(i * number + offset, (i + 1) * number + offset);
}
if (StringUtils.isNotEmpty(value)) {
result.add(value);
}
}
return result;
}