List转Tree，允许多棵树同时存在

最新推荐文章于 2023-12-10 18:36:31 发布

xuxie13

最新推荐文章于 2023-12-10 18:36:31 发布

阅读量179

点赞数

分类专栏：工具文章标签： java 开发语言

本文链接：https://blog.csdn.net/xuxie13/article/details/126055794

版权

工具专栏收录该内容

10 篇文章 0 订阅

订阅专栏

结果展示

   {
            "id": "1564",
            "parentId": "0",
            "name": "tw",
            "sort": 0
        },
        {
            "id": "1550",
            "parentId": "1547",
            "name": "te",
            "sort": 0,
            "children": [
                {
                    "id": "1615",
                    "parentId": "1550",
                    "name": "qwa1",
                    "sort": 0
                }
            ]
        },
        {
            "id": "1548",
            "parentId": "0",
            "name": "terr",
            "sort": 0,
            "children": [
                {
                    "id": "1549",
                    "parentId": "1548",
                    "name": "ter",
                    "sort": 0
                }
            ]
        }

原始数据

在这里插入图片描述

代码

@Data
public class Info implements Serializable {
    
    private Integer id;

    /** 公司id */
    private Integer companyId;
    
    /** 父节点id */
    private Integer parentId;
    
    /** 排序 */
    private Integer sort;

    /** 创建人 */
    private Integer createUserId;
    
    @Transient
    private List<Info> children;
}

Utils


    /**
     * 树结构遍历
     *
     * @param treeList
     * @return
     */
    public static List<Tree<String>> buildTree(List<Info> treeList) {
        List<Info> treeNodes = treeList;
        List<Info> trees = new ArrayList<Info>();
        if (!CollectionUtils.isEmpty(treeNodes)) {
            for (int i = 0; i < treeNodes.size(); i++) {
                Info boi = getChildren(treeNodes.get(i), treeList);
                if (boi != null) {
                    //不空是顶级节点
                    trees.add(boi);
                }
            }
        }
        trees.sort(Comparator.comparing(Info::getSort));
        // 封装 数据
        return packCaseObjectIno( trees, new LinkedList<>() );
    }

    /**
     * 判断此节点是否为顶级节点
     *
     * @param treeNode
     * @param treeNodes
     * @return
     */
    public static Info getChildren(Info treeNode, List<Info> treeNodes) {
        boolean isParent = true;
        if (treeNode.getParentId() != 0) {
            for (Info it : treeNodes) {
                if (treeNode.getParentId().equals(it.getId())) {
                    isParent = false;
                    break;
                }
            }
        }
        if (isParent) {
            return findChildren(treeNode, treeNodes);
        }
        return null;
    }

    /**
     * 递归查找子节点
     *
     * @param treeNodes
     * @return
     */
    public static Info findChildren(Info treeNode, List<Info> treeNodes) {
        treeNode.setChildren(new ArrayList<Info>());
        for (Info it : treeNodes) {
            if (treeNode.getId().equals(it.getParentId())) {
                if (treeNode.getChildren() == null) {
                    treeNode.setChildren(new ArrayList<Info>());
                }
                treeNode.getChildren().add(findChildren(it, treeNodes));
            }
        }
        if (treeNode.getChildren() != null && treeNode.getChildren().size()>0) {
            treeNode.getChildren().sort(Comparator.comparing(Info::getSort));
        }
        return treeNode;
    }


    public static List<Tree<String>> packCaseObjectIno(List<Info> list,List<Tree<String>> tree ){
        for (Info info:list) {
            List<Tree<String>> tr = new LinkedList<>();
            Tree<String> tre = new Tree<>();
            tre.setId(info.getId().toString());
            tre.setParentId(info.getParentId().toString());
            tre.put("sort", info.getSort());
            tre.put("name", info.getName());
            tre.put("createUserId", info.getCreateUserId());
            if(CollectionUtil.isNotEmpty(info.getChildren())){
                tre.setChildren(packCaseObjectIno(info.getChildren(),tr));
            }
            tree.add(tre);
        }
        return tree;
    }