/**
     * 對(duì)象List轉(zhuǎn)為T(mén)ree樹(shù)形結(jié)構(gòu)
     *
     * @param entityList       傳進(jìn)來(lái)的泛型List
     * @param primaryFieldName 主鍵名稱(chēng)
     * @param parentFieldName  父級(jí)字段名稱(chēng)
     * @return
     */
    public final List<Map<String, Object>> listToTree(List<Map<String, Object>> entityList, String primaryFieldName, String parentFieldName) {
        //返回的map Tree樹(shù)形結(jié)構(gòu)
        List<Map<String, Object>> treeMap = new ArrayList<>();
        //將傳進(jìn)的參數(shù)entityList轉(zhuǎn)為MapList
        List<Map<String, Object>> listMap = JSON.parseObject(JSON.toJSONString(entityList), List.class);
        //聲明一個(gè)map用來(lái)存listMap中的對(duì)象，key為對(duì)象id，value為對(duì)象本身
        Map<String, Map<String, Object>> entityMap = new Hashtable<>();
        //循環(huán)listMap把map對(duì)象put到entityMap中去
        listMap.forEach(map -> entityMap.put(map.get(primaryFieldName).toString(), map));
        //循環(huán)listMap進(jìn)行Tree樹(shù)形結(jié)構(gòu)組裝
        listMap.forEach(map -> {
            //獲取map的pid
            Object pid = map.get(parentFieldName);
            //判斷pid是否為空或者為0，為空說(shuō)明是最頂級(jí)，直接add到返回的treeMap中去
            if (pid == null || StringUtils.equals(pid.toString(), "0")) {
                treeMap.add(map);
            } else {
                //如果pid不為空也不為0，是子集
                // 根據(jù)當(dāng)前map的pid獲取上級(jí) parentMap
                Map<String, Object> parentMap = entityMap.get(pid.toString());
                if (parentMap == null) { //如果parentMap為空，則說(shuō)明當(dāng)前map沒(méi)有父級(jí)，當(dāng)前map就是頂級(jí)
                    treeMap.add(map);
                } else {
                    //如果parentMap不為空，則當(dāng)前map為parentMap的子級(jí)
                    //取出parentMap的所有子級(jí)的List集合
                    List<Map<String, Object>> children = (List<Map<String, Object>>) parentMap.get("children");
                    if (children == null) {  //判斷子級(jí)集合是否為空，為空則新創(chuàng)建List
                        children = new ArrayList<>();
                        parentMap.put("children", children);
                    }
                    //把當(dāng)前map對(duì)象add到parentMap的子級(jí)List中去
                    children.add(map);
                    /**
                     * 因?yàn)閜arentMap是從entityMap中g(shù)et出來(lái)的，
                     * 而entityMap中的value又是來(lái)自于listMap對(duì)象，
                     * 所以parentMap和entityMap中的value的地址都是指向listMap中的對(duì)象，
                     * 所以parentMap的children和entityMap中的value的children改變時(shí)，都會(huì)改變listMap中的對(duì)象，
                     * 這里涉及到了地址、指針，就不多說(shuō)了。
                     */
                }
            }
        });
        return treeMap;
    }

public class TreeTest {
    public static void main(String[] args) {
        List<Tree> node = forMethod(treeList);
        System.out.println(node);
    }
?
    /**
     * 雙重for循環(huán)方法轉(zhuǎn)換成樹(shù)形結(jié)構(gòu)
     * @param treeList
     * @return
     */
    public static List<Tree> forMethod(List<Tree> treeList) {
        List<Tree> rootTree = new ArrayList<>();
        for (Tree tree : treeList) {
            // 第一步 篩選出最頂級(jí)的父節(jié)點(diǎn)
            if (0 == tree.getParentId()) {
                rootTree.add(tree);
            }
            // 第二步 篩選出該父節(jié)點(diǎn)下的所有子節(jié)點(diǎn)列表 
            for (Tree node : treeList) {
                if (node.getParentId().equals(tree.getId())) {
                    if (CollectionUtils.isEmpty(tree.getChildren())) {
                        tree.setChildren(new ArrayList<>());
                    }
                    tree.getChildren().add(node);
                }
            }
        }
        return rootTree;
    }
}

public class TreeTest {
    public static void main(String[] args) {
        List<Tree> node = recursionMethod(treeList);
        System.out.println(node);
    }
    /**
     * 遞歸方法轉(zhuǎn)換成樹(shù)形結(jié)構(gòu)
     * @param treeList
     * @return
     */
    public static List<Tree> recursionMethod(List<Tree> treeList) {
        List<Tree> trees = new ArrayList<>();
        for (Tree tree : treeList) {
            // 找出父節(jié)點(diǎn)
            if (0 == tree.getParentId()) {
                // 調(diào)用遞歸方法填充子節(jié)點(diǎn)列表
                trees.add(findChildren(tree, treeList));
            }
        }
        return trees;
    }
?
    /**
     * 遞歸方法
     * @param tree 父節(jié)點(diǎn)對(duì)象
     * @param treeList 所有的List
     * @return
     */
    public static Tree findChildren(Tree tree, List<Tree> treeList) {
        for (Tree node : treeList) {
            if (tree.getId().equals(node.getParentId())) {
                if (tree.getChildren() == null) {
                    tree.setChildren(new ArrayList<>());
                }
                // 遞歸 調(diào)用自身
                tree.getChildren().add(findChildren(node, treeList));
            }
        }
        return tree;
    }
}

public class TreeTest {
    public static void main(String[] args) {
        List<Tree> node = recursionMethod(treeList);
        System.out.println(node);
    }
    /**
     * stream方法轉(zhuǎn)換成樹(shù)形結(jié)構(gòu)
     * @param treeList
     * @return
     */
    public static List<Tree> streamMethod(List<Tree> treeList) {
        List<Tree> list = treeList.stream()
                                  // 篩選出父節(jié)點(diǎn)
                                  .filter(t -> t.getParentId() == 0)
                                  // 設(shè)置父節(jié)點(diǎn)的子節(jié)點(diǎn)列表
                                  .map(item -> {item.setChildren(streamGetChildren(item, treeList)); return item;})
                                  .collect(Collectors.toList());
        return list;
    }
?
    /**
     * stream 方式遞歸查找子節(jié)點(diǎn)列表
     * @return
     */
    public static List<Tree> streamGetChildren(Tree tree, List<Tree> treeList) {
        List<Tree> list = treeList.stream()
                                  .filter(t -> t.getParentId().equals(tree.getId()))
                                  .map(item -> {item.setChildren(streamGetChildren(item, treeList)); return item;})
                                  .collect(Collectors.toList());
        return list;
    }
}

// 第一種優(yōu)化，我們合并上述兩個(gè)方法的相同部分
public class TreeTest {
    public static void main(String[] args) {
        List<Tree> node = streamMethod(0, treeList);
        System.out.println(node);
    }
?
    /**
     * stream 方法轉(zhuǎn)換樹(shù)形結(jié)構(gòu)方法的優(yōu)化
     * @param parentId
     * @param treeList
     * @return
     */
    public static List<Tree> streamMethod(Integer parentId, List<Tree> treeList) {
        List<Tree> list = treeList.stream()
                // 篩選父節(jié)點(diǎn)
                .filter(t -> t.getParentId().equals(parentId))
                // 遞歸設(shè)置子節(jié)點(diǎn)
                .map(item -> {
                    item.setChildren(streamMethod(item.getId(), treeList));
                    return item;
                })
                .collect(Collectors.toList());
        return list;
    }
}
// 第二種優(yōu)化，只是寫(xiě)法的不同，核心思路不變
public class TreeTest {
    public static void main(String[] args) {
        List<Tree> node = streamMethod(0, treeList);
        System.out.println(node);
    }
    /**
     * stream 方法轉(zhuǎn)換樹(shù)形結(jié)構(gòu)方法的優(yōu)化
     * @param parentId
     * @param treeList
     * @return
     */
    public static List<Tree> streamMethod(Integer parentId, List<Tree> treeList) {
        List<Tree> list = new ArrayList<>();
        Optional.ofNullable(treeList).orElse(new ArrayList<>())
                .stream()
                // 第一次篩選出主父節(jié)點(diǎn)列表進(jìn)入循環(huán)，循環(huán)里面 進(jìn)入遞歸 篩選出遞歸傳遞的從父節(jié)點(diǎn)列表
                .filter(root -> root.getParentId().equals(parentId))
                // 遞歸，最末的父節(jié)點(diǎn)從整個(gè)列表篩選出它的子節(jié)點(diǎn)列表依次組裝
                .forEach(tree -> {
                    List<Tree> children = streamMethod(tree.getId(), treeList);
                    tree.setChildren(children);
                    list.add(tree);
                });
        return list;
    }
}

public class TreeTest {
    public static void main(String[] args) {
        // treeList 是已經(jīng)處理好的 樹(shù)形結(jié)構(gòu) 集合
        countHandler(treeList);
        System.out.println(treeList);
    }
?
    /**
     * 遞歸將子節(jié)點(diǎn)屬性值累加給父節(jié)點(diǎn)
     * @param treeList
     * @return
     */
    private int countHandler(List<Tree> treeList) {
        int count = 0;
        if(CollectionUtil.isEmpty(treeList)){
            return count;
        }
        for (Tree tree : treeList) {
            count += tree.getCount();
            if (CollectionUtil.isEmpty(tree.getChildren())) {
                continue;
            }
            count += countHandler(tree.getChildren());
            tree.setCount(count);
            if (tree.getParentId() == null || tree.getParentId() == 0) {
                count = 0;
            }
        }
        return count;
    }
}