JAVA(单表)权限树的递归编写

1、数据库请求数据返回实体

@Data
public class Department {

    private Long id;

    private String name;

    private Long parentId;

}

2、返回前段数据格式实体

@Data
public class DepartmentDTO {

    private Long id;

    private String name;

    private Long parentId;

    private List<DepartmentDTO> children = new ArrayList<>();

}

3、主调用方法

private static List<DepartmentDTO> makeTree(List<DepartmentDTO> departmentList, Long pId) {

    //子类
    List<DepartmentDTO> children = departmentList.stream().filter(x -> x.getParentCode()==pId).collect(Collectors.toList());

    //后辈中的非子类
    List<DepartmentDTO> successor = departmentList.stream().filter(x -> x.getParentCode()!=pId).collect(Collectors.toList());

    children.forEach(x ->{
                makeTree(successor, x.getDepartmentId()).forEach(
                        y -> x.getChildren().add(y)
                );
            }
    );
    return children;
}

4、测试方法

List<Department> departmentList = new ArrayList<>();

 departmentList.add(new Department(1, "白胡子", 0));
 departmentList.add(new Department(2, "不死鸟", 1));
 departmentList.add(new Department(3, "艾斯", 1));
 departmentList.add(new Department(4, "龙", 0));
 departmentList.add(new Department(5, "路飞", 4));
 departmentList.add(new Department(6, "索隆", 5));
 departmentList.add(new Department(7, "娜美", 5));
 departmentList.add(new Department(8, "罗宾", 5));
 departmentList.add(new Department(9, "乌索普", 5));
 departmentList.add(new Department(10, "小丑", 100));//小丑的长官Id不存在,所以tree中没有它的信息
List<PermissionDTO> tree = makeTree(departmentList , 0);
String s = JSON.toJSONString(tree);
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值