开箱即用系列-工具包-树形结构链表排序(递归)

最新推荐文章于 2022-03-11 16:39:24 发布

奔随梦

最新推荐文章于 2022-03-11 16:39:24 发布

阅读量207

点赞数 1

分类专栏：后端技术-算法文章标签：排序算法

本文链接：https://blog.csdn.net/lzhlove/article/details/88431385

版权

后端技术-算法专栏收录该内容

3 篇文章 0 订阅

订阅专栏

使用背景:

菜单树结构的数据,需要排序的时候.

菜单级别-树结构排序

maven依赖:
        <dependency>
            <groupId>org.projectlombok</groupId>
            <artifactId>lombok</artifactId>
            <version>1.16.20<version>
        </dependency>
        <dependency>
            <groupId>com.google.guava</groupId>
            <artifactId>guava</artifactId>
            <version>22.0</version>
        </dependency>

代码实现:

import com.bruce.tool.common.util.ClassUtils;
import com.google.common.collect.Lists;
import com.google.common.collect.Maps;
import lombok.AccessLevel;
import lombok.NoArgsConstructor;
import org.springframework.util.CollectionUtils;

import java.util.List;
import java.util.Map;

@NoArgsConstructor(access = AccessLevel.PRIVATE)
public class SortUtils {

    public static <E> List<E> tree(List<E> entities,String idKey,String pidKey) {
        Integer rootId = 0;
        Map<Integer,List<E>> parents = Maps.newConcurrentMap();
        Map<Integer,E> nodes = Maps.newConcurrentMap();
        for (E entity : entities) {
            Integer id = ClassUtils.getValue(entity,idKey);
            Integer pid = ClassUtils.getValue(entity,pidKey);
            if( rootId > pid ){ rootId = pid;}
            nodes.put(id,entity);
            List<E> childrens = parents.get(pid);
            if(CollectionUtils.isEmpty(childrens) ){
                childrens = Lists.newArrayList();
                parents.put(pid,childrens);
            }
            childrens.add(entity);
        }

        if( CollectionUtils.isEmpty(nodes) ){ return entities; } // 结束排序

        List<E> rootNodes = Lists.newArrayList();
        for (Map.Entry<Integer,E> entry : nodes.entrySet()) {
            E entity = entry.getValue();
            Integer pid = ClassUtils.getValue(entity,pidKey);
            if( rootId.equals(pid) ){
                rootNodes.add(entity);
            }
        }

        List<E> sorted = Lists.newArrayList();
        recursion(parents,rootNodes,idKey,sorted);
        return sorted;
    }

    /**递归**/
    private static <E> void recursion(Map<Integer, List<E>> parents, List<E> childrens, String idKey, List<E> sorted){
        if( CollectionUtils.isEmpty(childrens) ){ return; }
        for (E children : childrens) {
            sorted.add(children);
            Integer id = ClassUtils.getValue(children,idKey);
            recursion(parents,parents.get(id),idKey, sorted);
        }
    }

}

补充说明:
若有改进建议,欢迎留言.