Stream实现递归查询树形结构
一、简单应用
public class TreeStructure {
public static List<tree> getTreeStructure(List<tree> list){
return list.stream().filter(tree -> tree.getPid()==0).peek(tree -> tree.setChildTree(getChildTree(tree,list))).collect(Collectors.toList());
}
private static List<tree> getChildTree(tree tree, List<tree> list) {
return list.stream().filter(tr->tr.getPid()==tree.getId()).map(tr->{
tr.setChildTree(getChildTree(tr,list));
return tr;
}).collect(Collectors.toList());
}
}
@Data
@ToString
class tree{
private int id;
private int pid;
private List<tree> childTree = new ArrayList<>();
public tree(int id, int pid) {
this.id=id;
this.pid=pid;
}
}
class test{
public static List<tree> testData(){
return new ArrayList<tree>(){{
add(new tree(1,0));
add(new tree(2,0));
add(new tree(3,0));
add(new tree(4,1));
add(new tree(5,2));
add(new tree(6,3));
add(new tree(7,4));
add(new tree(8,5));
add(new tree(9,6));
}};
}
public static void main(String[] args) {
System.out.println(JSON.toJSONString(TreeStructure.getTreeStructure(testData())));
}
}