java8新特性-stream实现递归树形结构

项目需求中会有需求是查询出来菜单树形结构,那么可以使用java8新特性去实现。

模拟表中数据

实体类

@ApiModel(value = "树结构信息")
@Data
@AllArgsConstructor
public class TreeEntity {

    @ApiModelProperty("唯一id")
    private Integer id;

    @ApiModelProperty("名称")
    private String name;

    @ApiModelProperty("父类id")
    private Integer parentId;

    @ApiModelProperty("子节点集合")
    private List<TreeEntity> childNodeList;
}

模拟表中假数据:通俗好理解

    static List<TreeEntity>  listTree = new ArrayList<>();
    static {
        listTree.add(new TreeEntity(1,"爷",0,null));
        listTree.add(new TreeEntity(2,"二爷",0,null));
        listTree.add(new TreeEntity(3,"爷-爸",1,null));
        listTree.add(new TreeEntity(4,"爷-叔",1,null));
        listTree.add(new TreeEntity(5,"二爷-爸",2,null));
        listTree.add(new TreeEntity(6,"爷-爸-大儿子",3,null));
        listTree.add(new TreeEntity(7,"爷-爸-小儿子",3,null));
        listTree.add(new TreeEntity(8,"二爷-爸-大儿子",5,null));
        listTree.add(new TreeEntity(9,"二爷-爸-小儿子",5,null));
        listTree.add(new TreeEntity(10,"爷-叔-大儿子",4,null));
        listTree.add(new TreeEntity(11,"爷-叔-小儿子",4,null));
    }

 递归实现:

   /**
     * 获取树结构
     * @return
     *  
     */
    @Override
    public List<TreeEntity> selectTree() {
        List<TreeEntity> leve1Menus = listTree.stream().filter(treeEntity ->
             treeEntity.getParentId() == 0
        ).map((menus) ->{
             menus.setChildNodeList(getChildNode(menus,listTree));
             return menus;
        }).collect(Collectors.toList());
        return leve1Menus;
    }




   /**
     * 递归子节点
     * @param root   当前单个菜单
     * @param allListTree   表中的所有菜单集合
     * @return
     */
    private List<TreeEntity> getChildNode(TreeEntity root, List<TreeEntity> allListTree){

        List<TreeEntity> ChildNodeList = allListTree.stream().filter((treeEntity) -> {
            return treeEntity.getParentId() == root.getId();
        }).map((treeEntity)->{
            treeEntity.setChildNodeList(getChildNode(treeEntity,allListTree));
            return treeEntity;
        }).collect(Collectors.toList());
        return ChildNodeList;
    }

结果显示:

[
  {
    "id": 1,
    "name": "爷",
    "parentId": 0,
    "childNodeList": [
      {
        "id": 3,
        "name": "爷-爸",
        "parentId": 1,
        "childNodeList": [
          
            "id": 6,
            "name": "爷-爸-大儿子",
            "parentId": 3,
            "childNodeList": []
          },
          {
            "id": 7,
            "name": "爷-爸-小儿子",
            "parentId": 3,
            "childNodeList": []
          }
        ]
      },
      {
        "id": 4,
        "name": "爷-叔",
        "parentId": 1,
        "childNodeList": [
          {
            "id": 10,
            "name": "爷-叔-大儿子",
            "parentId": 4,
            "childNodeList": []
          },
          {
            "id": 11,
            "name": "爷-叔-小儿子",
            "parentId": 4,
            "childNodeList": []
          }
        ]
      }
    ]
  },
  {
    "id": 2,
    "name": "二爷",
    "parentId": 0,
    "childNodeList": [
      {
        "id": 5,
        "name": "二爷-爸",
        "parentId": 2,
        "childNodeList": [
          {
            "id": 8,
            "name": "二爷-爸-大儿子",
            "parentId": 5,
            "childNodeList": []
          },
          {
            "id": 9,
            "name": "二爷-爸-小儿子",
            "parentId": 5,
            "childNodeList": []
          }
        ]
      }
    ]
  }
]

 

  • 12
    点赞
  • 65
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 23
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 23
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

油锅里的猪

您的鼓励将是我创作最大的动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值