构建树形结构

最新推荐文章于 2023-08-20 21:53:52 发布

abilities_zhx

最新推荐文章于 2023-08-20 21:53:52 发布

阅读量142

点赞数

文章标签： java jvm 开发语言

本文链接：https://blog.csdn.net/qq_50295533/article/details/128189087

版权

构建树形结构

1.平铺数据

private static List<Map> menuList(){
    List<Map> menus = new ArrayList<>();
    Map menu1 = new HashMap();
    menu1.put("parentId",0);
    menu1.put("name","系统设置");
    menu1.put("id",1);
    menu1.put("childList",new ArrayList<>());
    Map menu2 = new HashMap();
    menu2.put("parentId",0);
    menu2.put("name","系统监控");
    menu2.put("id",2);
    menu2.put("childList",new ArrayList<>());
    Map menu3 = new HashMap();
    menu3.put("parentId",1);
    menu3.put("name","用户管理");
    menu3.put("id",3);
    menu3.put("childList",new ArrayList<>());
    Map menu4 = new HashMap();
    menu4.put("parentId",3);
    menu4.put("name","用户列表");
    menu4.put("id",4);
    menu4.put("childList",new ArrayList<>());
    menus.add(menu1);
    menus.add(menu2);
    menus.add(menu3);
    menus.add(menu4);
    return menus;
}
/**[{"name":"系统设置","childList":[],"id":1,"parentId":0},{"name":"系统监控","childList":[],"id":2,"parentId":0},{"name":"用户管理","childList":[],"id":3,"parentId":1},{"name":"用户列表","childList":[],"id":4,"parentId":3}]*/

2.得到子节点列表

/**
* list 数据
* t 当前节点(父节点)
*/
private static List<Map> getChildMapList(List<Map> list, Map t)
{
    List<Map> tlist = new ArrayList<Map>();
    Iterator<Map> it = list.iterator();
    while (it.hasNext())
    {
        Map n = (Map) it.next();
        if (Integer.parseInt(n.get("parentId")+"") == Integer.parseInt(t.get("id")+""))
        {
            tlist.add(n);
        }
    }
    return tlist;
}

3.递归列表

private static void recursionFnMap(List<Map> list, Map t)
{
    // 得到子节点列表
    List<Map> childList = getChildMapList(list, t);
    t.put("childList",childList);
    for (Map tChild : childList)
    {
        if (getChildMapList(list, t).size() > 0)
        {
            recursionFnMap(list, tChild);
        }
    }
}

4.构建树结构

 /**
   * @param menus 菜单列表
   * @return 树结构列表
   */
public static List<Map> buildMapTree(List<Map> menus)
{
    List<Map> returnList = new ArrayList<Map>();
    List<Integer> tempList = new ArrayList<Integer>();
    for (Map dept : menus)
    {
        tempList.add(Integer.parseInt(dept.get("id")+""));
    }
    for (Iterator<Map> iterator = menus.iterator(); iterator.hasNext();)
    {
        Map menu = (Map) iterator.next();
        // 如果是顶级节点, 遍历该父节点的所有子节点
        if (!tempList.contains(Integer.parseInt(menu.get("parentId")+"")))
        {
            recursionFnMap(menus, menu);
            returnList.add(menu);
        }
    }
    if (returnList.isEmpty())
    {
        returnList = menus;
    }
    return returnList;
}

5.运行

public static void main(String[] args) {
        List<Map> list = menuList();
        System.out.println("-------平铺展示-------\n"+JSONUtil.toJsonStr(list));
        List<Map> mapList = buildMapTree(list);
        System.out.println("\n-------树形展示-------\n"+JSONUtil.toJsonStr(mapList));

}
-- run result
-------平铺展示-------
[{"name":"系统设置","childList":[],"id":1,"parentId":0},{"name":"系统监控","childList":[],"id":2,"parentId":0},{"name":"用户管理","childList":[],"id":3,"parentId":1},{"name":"用户列表","childList":[],"id":4,"parentId":3}]

-------树形展示-------
[{"name":"系统设置","childList":[{"name":"用户管理","childList":[{"name":"用户列表","childList":[],"id":4,"parentId":3}],"id":3,"parentId":1}],"id":1,"parentId":0},{"name":"系统监控","childList":[],"id":2,"parentId":0}]