菜单树形结构代码模板

将菜单数据按树形结构返回

public class Algorithm {
    public static void main(String[] args) {
        List<Tree> list = new ArrayList<>();
        Tree tree1 = new Tree();
        tree1.setId(1);
        tree1.setName("一级1菜单");
        list.add(tree1);
        list.add(tree1);
        Tree tree21 = new Tree();
        tree21.setId(2);
        tree21.setName("二级1菜单");
        tree21.setParentId(1);
        list.add(tree21);
        Tree tree22 = new Tree();
        tree22.setId(3);
        tree22.setName("二级2菜单");
        tree22.setParentId(1);
        list.add(tree22);
        Tree tree32 = new Tree();
        tree32.setId(4);
        tree32.setName("三级2菜单");
        tree32.setParentId(3);
        list.add(tree32);
        Tree tree2 = new Tree();
        tree2.setId(5);
        tree2.setName("一级2菜单");
        list.add(tree2);
        List<Tree> result = new ArrayList<>();
        Map<Integer, Tree> map = new HashMap<>();
        for (Tree tree : list) {
            map.put(tree.getId(), tree);
        }
        for (Tree tree : list) {
            Integer parentId = tree.getParentId();
            if (parentId != null ) {
                Tree parentTree = map.get(parentId);
                List<Tree> chrildrenTreeList = parentTree.getChildTreeList();
                if (chrildrenTreeList == null) {
                    chrildrenTreeList = new ArrayList<>();
                    parentTree.setChildTreeList(chrildrenTreeList);
                }
                chrildrenTreeList.add(tree);
            } else {
                result.add(tree);
            }
        }
        System.out.println(result.toString());
    }
}
class Tree {
    private Integer id;
    private String name;
    private Integer parentId;
    private List<Tree> childTreeList;

    public Integer getId() {
        return id;
    }

    public void setId(Integer id) {
        this.id = id;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public Integer getParentId() {
        return parentId;
    }

    public void setParentId(Integer parentId) {
        this.parentId = parentId;
    }

    public List<Tree> getChildTreeList() {
        return childTreeList;
    }

    public void setChildTreeList(List<Tree> childTreeList) {
        this.childTreeList = childTreeList;
    }

    @Override
    public String toString() {
        return "Tree{" +
                "id=" + id +
                ", name='" + name + '\'' +
                ", parentId=" + parentId +
                ", childTreeList=" + childTreeList +
                '}';
    }
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值