日记

136 阅读1分钟

记录修改下拉树递归

 for (FyTree fa : father) {
      fa.setChildren(getChildrens(fa, list));
    }
  private List<FyTree> getChildrens(FyTree fa, List<FyTree> list) {
    List<FyTree> childList = new ArrayList<>();
    //父级代码
    String fjdm = fa.getCourtCode();
    //获取第一层
    for (FyTree tree : list) {
      if (StringUtils.isNotBlank(tree.getParentId())) {
        String parentId = tree.getParentId();
        if (fjdm.equals(parentId)) {
          childList.add(tree);
        }
      }
    }
    //遍历第二层
    for (FyTree fyTree : childList) {
      fyTree.setChildren(getChildrens(fyTree, list));
    }
    if (childList.size() == 0) {
      return null;
    }
    return childList;
  }