后台设置树形数据-递归方法

最新推荐文章于 2022-12-13 16:29:02 发布

HLucas

最新推荐文章于 2022-12-13 16:29:02 发布

阅读量480

点赞数

分类专栏： Java 文章标签： Java 树形菜单

本文链接：https://blog.csdn.net/qq_38912494/article/details/100926205

版权

Java 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

/**
   * hhl
   * @param listTree 类型值List<Map<String , Object>>
   * @return 树形结构
   */
   public static List<Object> getTree(List<Map<String , Object>> listTree) {
       List<Object> list = new ArrayList<Object>();
       for (Map<String, Object> entry: listTree) {
       Map<String,Object> mapArr = new LinkedHashMap<String, Object>();
       if(entry.get("parentid").equals("0")){ //判断是否为父极
       mapArr.put("id", entry.get("id"));
       mapArr.put("title", entry.get("text"));
       mapArr.put("children", menuChild(entry.get("id").toString(),listTree)); //去子集查找遍历
       list.add(mapArr);
       }
       }
       return list;
   }
   /**
   * hhl 递归树
   * @param id
   * @param list
   * @return
   */
   public static List<?> menuChild(String id,List<Map<String, Object>> list){ //子集查找遍历
   List<Object> lists = new ArrayList<Object>();
   for(Map<String, Object> entry: list){
   Map<String,Object> childArray = new LinkedHashMap<String, Object>();
   if(entry.get("parentid").equals(id) ){
   childArray.put("id", entry.get("id"));
   childArray.put("title", entry.get("text"));
   childArray.put("children", menuChild(entry.get("id").toString(),list));
   lists.add(childArray);
   }
   }
   return lists;
   }