java高效率list转tree
最近写的项目里有list转tree需求,之前也写过。所以写下来给大家参考,避免重复造轮子。
网上有很多关于list转tree的文章,但是有很多效率很低,每次都要循环整个list。如果数据量大的话会特别慢(我们公司组织架构,大概有几千条数据,转化为tree明显就很慢),用我下面的方法瞬间就能转化完成。
话不多说上代码:
<!-- pom我引用了lombok,省去了get,set。如果不引用的话,TreeNode需要写get,set方法 -->
<dependency>
<groupId>org.projectlombok</groupId>
<artifactId>lombok</artifactId>
<version>1.18.12</version>
</dependency>
TreeNote 类,这里只有核心属性,您实际使用时可根据需求添加属性
import lombok.Data;
import java.util.List;
/**
* @author 陈飞 (chenfei_kd@qq.com)
* @version v1.0
* @since 2020/7/27 11:04
*/
@Data
public class TreeNode {
private Integer id;
private Integer pid;
private String name;
private List<TreeNode> children;
public TreeNode() {
}
public TreeNode(Integer id, Integer pid, String name) {
this.id = id;
this.pid = pid;
this.name = name;
}
}
注意下面是转化方法了
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**
* @author 陈飞 (chenfei_kd@qq.com)
* @version v1.0
* @since 2020/7/27 11:11
*/
public class ListToTree {
public static void main(String[] args) {
/**
* 初始化一个list数据,pid=0为根节点
*/
List<TreeNode> list = new ArrayList<TreeNode>();
list.add(new TreeNode(1, 0, "1"));
list.add(new TreeNode(2, 0, "2"));
list.add(new TreeNode(3, 2, "3"));
list.add(new TreeNode(4, 3, "4"));
list.add(new TreeNode(5, 4, "5"));
list.add(new TreeNode(6, 5, "6"));
List<TreeNode> tree = toTree(list);
System.out.println(tree);
}
/**
* 转化树形结构
* 1、首先把list转成map pid作为key,List<TreeNode>作为value
* 2、递归转化Tree结构
* @param list
* @return
*/
public static List<TreeNode> toTree(List<TreeNode> list) {
Map<Integer, List<TreeNode>> map = new HashMap<Integer, List<TreeNode>>();
for (TreeNode tn : list) {
Integer key = tn.getPid();
if(map.containsKey(key)) {
map.get(key).add(tn);
} else {
List<TreeNode> mapValue = new ArrayList<TreeNode>();
mapValue.add(tn);
map.put(tn.getPid(), mapValue);
}
}
List<TreeNode> tree = map.get(0);
recursionToTree(tree, map);
return tree;
}
/**
* 递归转化Tree结构
* @param list,map
* @param map
*/
public static void recursionToTree(List<TreeNode> list, Map<Integer, List<TreeNode>> map){
for(TreeNode tn : list){
Integer key = tn.getId();
if(map.containsKey(key)) {
List<TreeNode> children = map.get(key);
tn.setChildren(children);
recursionToTree(children, map);
}
}
}
}
核心代码如上面所写。如果觉得不够灵活,可使用合适的设计模式重新改造。抽象接口,使用泛型,反射等等
如有效率更快的写法,欢迎留言。
升级版本啦
随手写出来的,仅供参考,算是提供个思路,如有更好的写法希望能分享
需求:任意有逻辑关系的list转tree结构
实现:
- 对象继承 Treeable类,并实现方法
- 实例化 ListToTree类,调用 toTree方法。搞定收工
首先定义两个接口类:
import java.util.List;
/**
* 节点类继承接口,节点类必须继承此类
* @author 陈飞 (chenfei_kd@qq.com)
* @version v1.0
* @since 2020/7/27 15:40
*/
public interface Treeable<T> {
/**
* 获取存入map key
* @return
*/
Object getMapKey();
/**
* 获取孩子节点的key值
* @return
*/
Object getChildrenKey();
/**
* 根节点key值
* @return
*/
Object getRootKey();
/**
* 子节点赋值
* @param children
*/
void setChildren(List<T> children);
}
/**
* ListToTree 一个函数式接口
*/
import java.util.List;
public interface ListToTree<T extends Treeable> {
/**
* list转化tree结构
*/
List<T> toTree(List<T> list);
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**
* list转tree的实现(有两处判断是否为空的,TODO 根据自己的业务自行实现)
* @author 陈飞 (chenfei_kd@qq.com)
* @version v1.0
* @since 2020/7/27 15:07
*/
public class ListToTreeImpl implements ListToTree {
@Override
public List toTree(List list) {
// TODO list 空判断,做处理
Map<Object, List> map = new HashMap<Object, List>();
Object rootKye = null;
for(Object o : list) {
Treeable t = (Treeable) o;
Object key = t.getMapKey();
if(map.containsKey(key)) {
map.get(key).add(o);
} else {
List mapValue = new ArrayList();
mapValue.add(o);
map.put(key, mapValue);
}
// 获取根节点key值
if(rootKye == null) {
rootKye = t.getRootKey();
}
}
List tree = map.get(rootKye);
recursionToTree(tree, map);
return tree;
}
private void recursionToTree(List list, Map<Object, List> map){
// TODO list 空判断,做处理
for(Object o : list){
Treeable t = (Treeable) o;
Object key = t.getChildrenKey();
if(map.containsKey(key)) {
List children = map.get(key);
t.setChildren(children);
recursionToTree(children, map);
}
}
}
}
import lombok.Data;
import java.util.List;
/**
* 节点类(必须继承Treeable)
* @author 陈飞 (fei.chen01@ucarinc.com)
* @version v1.0
* @since 2020/7/27 11:04
*/
@Data
public class TreeNode implements Treeable {
private Integer id;
private Integer pid;
private String name;
private List<TreeNode> children;
public TreeNode() {
}
public TreeNode(Integer id, Integer pid, String name) {
this.id = id;
this.pid = pid;
this.name = name;
}
@Override
public Integer getMapKey() {
return pid;
}
@Override
public Integer getChildrenKey() {
return id;
}
@Override
public Integer getRootKey() {
return 0;
}
@Override
public void setChildren(List children) {
this.children = children;
}
}
看了这么多,终于可以测试了,运行下面main方法
import java.util.ArrayList;
import java.util.List;
/**
* @author 陈飞 (chenfei_kd@qq.com)
* @version v1.0
* @since 2020/7/27 15:40
*/
public class Demo {
public static void main(String[] args) {
/**
* 初始化一个list数据,pid=0为根节点
*/
List<TreeNode> list = new ArrayList<TreeNode>();
list.add(new TreeNode(1, 0, "1"));
list.add(new TreeNode(2, 0, "2"));
list.add(new TreeNode(3, 2, "3"));
list.add(new TreeNode(4, 3, "4"));
list.add(new TreeNode(5, 4, "5"));
list.add(new TreeNode(6, 5, "6"));
ListToTree treeBuilder = new ListToTreeImpl();
List<TreeNode> tree = treeBuilder.toTree(list);
System.out.println(tree);
}
}