zoukankan      html  css  js  c++  java
  • tree树形

     /**
      * tree
      * @param menuBeans
      * @param pid
      * @return
      */
     public JSON  makeTree(List<MenuBean> menuBeans,Integer pid){
      Map<String, Object> jsonMap;
      List<Map<String, Object>> lmjson = new ArrayList<Map<String,Object>>();
      for(MenuBean bean: menuBeans){
       if(pid==bean.getMenuParentId()||pid.equals(bean.getMenuParentId())){
        jsonMap = new HashMap<String, Object>();
        jsonMap.put("id", bean.getMenuParentId());
        jsonMap.put("text", bean.getText());
        if(bean.getLeaf()==0){
         if(bean.getMenuParentId()==0){
          jsonMap.put("state","open");
         }else{
             jsonMap.put("state","closed");
         }
         jsonMap.put("children",makeTree(menuBeans,bean.getId()));
        }else{
         String url=bean.getMenuUrl();
         if(url.contains("www")||url.contains("http")){
         }else{
          String urlR [] = url.split("/");
          url=urlR[0]+"/"+urlR[1]+"/easyui"+urlR[2];
         }
         jsonMap.put("url",url);
        }
        lmjson.add(jsonMap);
       }
       
      }
      
      return JSONArray.fromObject(lmjson);
     }

  • 相关阅读:
    网络流初步——增广路算法(EK)模板
    求大组合数
    RMQ问题
    欧拉函数
    [LintCode] Minimum Path Sum
    [LintCode] Unique Paths II
    [LintCode] Unique Paths
    [LintCode] Flip Bits
    [LintCode] O(1) Check Power of 2
    [LintCode] Count 1 in Binary
  • 原文地址:https://www.cnblogs.com/holdon521/p/4110763.html
Copyright © 2011-2022 走看看