树形结构工具类

package xxxxx;

import com.google.common.collect.Lists;
import lombok.Data;
import lombok.Getter;
import lombok.NoArgsConstructor;
import lombok.Setter;
import lombok.extern.slf4j.Slf4j;
import org.springframework.util.CollectionUtils;
import org.springframework.util.ObjectUtils;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;

/**
 * @ClassName TreeUtil
 * @Description 树形工具类
 * @Author lw
 * @Date 2021/12/23 8:54
 * @Version 0.0.2-SNAPSHOT
 */
@Slf4j
public class TreeUtil {


    /**
    * @author lw
    * @Description 获取属性结构
    * @Date 2021/12/23 8:58
    * @Param [list]
    * @return java.util.List<? extends TreeModel>
    **/
    public static List<? extends TreeUtil.TreeModel> tree(List<? extends TreeUtil.TreeModel> list){
        //存储根节点的菜单,即一级菜单
        List<TreeUtil.TreeModel> models =new ArrayList<>();
        //遍历所有数据,找到根节点菜单
        for (TreeUtil.TreeModel item: list) {
            if(StringUtils.equals("0", item.getParentCode()) || StringUtils.isBlank(item.getParentCode())){
                item.setLevel(1);
                //找到根节点菜单的时候,寻找这个根节点菜单下的子节点菜单。
                findChildren(item, list);
                //添加到根节点的列表中
                models.add(item);
            }
        }
        return models;
    }

    private static void findChildren(TreeModel root, List<? extends TreeUtil.TreeModel> list){
        List<TreeUtil.TreeModel> childrenList =new ArrayList<>();
        //遍历所有数据,找到是入参父节点的子节点的数据,然后加到childlist集合中。
        for (TreeUtil.TreeModel menu : list) {
            if (org.apache.commons.lang3.StringUtils.equals(root.getCode(), menu.getParentCode())){
                if (menu.getSort() == null) {
                    menu.setSort(0);
                }
                childrenList.add(menu);
                if (StringUtils.equals("0", root.getParentCode()) || StringUtils.isBlank(root.getParentCode())) {
                    menu.setLevel(2);
                } else {
                    if (!ObjectUtils.isEmpty(root.getLevel())) {
                        menu.setLevel(root.getLevel() + 1);
                    } else {
                        root.setLevel(2);
                    }
                }
            }
        }
        if (CollectionUtils.isEmpty(root.getChildren())) {
            //若子节点不存在,那么就不必再遍历子节点中的子节点了 直接返回。
            if(childrenList.size()==0) {
                return;
            }
            //排序
            childrenList.sort(Comparator.comparing(TreeModel::getSort));
            //设置父节点的子节点列表
            root.setChildren(childrenList);
        }
        //若子节点存在,接着递归调用该方法,寻找子节点的子节点。
        for (TreeUtil.TreeModel child : root.getChildren()) {
//            log.info("rootParentCode: {}", root.getParentCode());
//            log.info("rootCode: {}", root.getCode());
//            log.info("childParentCode: {}", child.getParentCode());
//            log.info("childCode: {}", child.getCode());
//            log.info("root: {}", root.toString());
//            log.info("child: {}", root.getChildren().toString());
            findChildren(child, list);
        }
    }

    @Data
    public static class TreeModel {
        private String parentCode;
        private String code;
        private Integer sort;
        private Integer level;
        private List<? extends TreeUtil.TreeModel> children = Lists.newArrayList();
    }

    @Getter
    @Setter
    @NoArgsConstructor
    public static class TreeDemo extends TreeUtil.TreeModel{
        private Integer id;
        private String name;


        public TreeDemo(Integer id, String name, String parentCode, String code, Integer orderNo) {
            this.id = id;
            this.name = name;
            super.setParentCode(parentCode);
            super.setCode(code);
            super.setSort(orderNo);
        }
    }


    public static void main(String[] args) {
        List<TreeUtil.TreeDemo> list = new ArrayList<>();
        list.add(new TreeUtil.TreeDemo(1, "tom", "0", "1", 1));
        list.add(new TreeUtil.TreeDemo(2, "jack", "1", "2", 1));
        list.add(new TreeUtil.TreeDemo(3, "rose", "1", "3", 2));
        List<TreeUtil.TreeModel> treeModels = (List<TreeModel>) TreeUtil.tree(list);
        System.out.println(treeModels.toString());
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是一个 Java 工具类,可以将树形结构数据输出为字符串: ```java import java.util.List; public class TreePrinter { private static final String LINE_PREFIX = " "; private static final String BRANCH_PREFIX = "│ "; private static final String LAST_BRANCH_PREFIX = "└── "; public static <T extends TreeNode> String printTree(T root) { StringBuilder sb = new StringBuilder(); printNode(sb, "", root, true); return sb.toString(); } private static <T extends TreeNode> void printNode(StringBuilder sb, String prefix, T node, boolean isLast) { sb.append(prefix); if (isLast) { sb.append(LAST_BRANCH_PREFIX); prefix += LINE_PREFIX; } else { sb.append(BRANCH_PREFIX); prefix += BRANCH_PREFIX; } sb.append(node.getName()); sb.append("\n"); List<T> children = node.getChildren(); if (children != null) { int size = children.size(); for (int i = 0; i < size; i++) { boolean last = i == size - 1; printNode(sb, prefix, children.get(i), last); } } } public interface TreeNode { String getName(); List<? extends TreeNode> getChildren(); } } ``` 使用方法: 1. 实现 `TreeNode` 接口,并实现其中的两个方法 `getName()` 和 `getChildren()`,分别返回节点名称和子节点列表。 2. 调用 `TreePrinter.printTree(root)` 方法,其中 `root` 为树的根节点。 以下是一个简单的例子: ```java import java.util.ArrayList; import java.util.List; public class Main { public static void main(String[] args) { TreeNode root = new Node("root"); Node node1 = new Node("node1"); Node node2 = new Node("node2"); Node node3 = new Node("node3"); Node node4 = new Node("node4"); Node node5 = new Node("node5"); Node node6 = new Node("node6"); root.addChild(node1); root.addChild(node2); root.addChild(node3); node2.addChild(node4); node2.addChild(node5); node3.addChild(node6); String tree = TreePrinter.printTree(root); System.out.println(tree); } static class Node implements TreePrinter.TreeNode { private String name; private List<Node> children; public Node(String name) { this.name = name; this.children = new ArrayList<>(); } public void addChild(Node child) { children.add(child); } @Override public String getName() { return name; } @Override public List<Node> getChildren() { return children; } } } ``` 输出结果为: ``` └── root ├── node1 ├── node2 │ ├── node4 │ └── node5 └── node3 └── node6 ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值