加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 编程开发 > Java > 正文

java、js中实现无限层级的树形结构方法(类似递归)

发布时间:2020-12-14 14:45:02 所属栏目:Java 来源:网络整理
导读:js中: var zNodes=[{id:0,pId:-1,name:"Aaaa"},{id:1,pId:0,name:"A"},{id:11,pId:1,name:"A1"},{id:12,name:"A2"},{id:13,name:"A3"},{id:2,name:"B"},{id:21,pId:2,name:"B1"},{id:22,name:"B2"},{id:23,name:"B3"},{id:3,name:"C"},{id:31,pId:3,name:"C

js中:

var zNodes=[
{id:0,pId:-1,name:"Aaaa"},{id:1,pId:0,name:"A"},{id:11,pId:1,name:"A1"},{id:12,name:"A2"},{id:13,name:"A3"},{id:2,name:"B"},{id:21,pId:2,name:"B1"},{id:22,name:"B2"},{id:23,name:"B3"},{id:3,name:"C"},{id:31,pId:3,name:"C1"},{id:32,name:"C2"},{id:33,name:"C3"},{id:34,pId:31,name:"x"},{id:35,name:"y"},{id:36,name:"z"},{id:37,pId:36,name:"z1123"},{id:38,pId:37,name:"z123123123"}  
];
function treeMenu(a){
  this.tree=a||[];
  this.groups={};
};
treeMenu.prototype={
  init:function(pid){
    this.group();
    return this.getDom(this.groups[pid]);
  },group:function(){
    for(var i=0;i<this.tree.length;i++){
      if(this.groups[this.tree[i].pId]){
        this.groups[this.tree[i].pId].push(this.tree[i]);
      }else{
        this.groups[this.tree[i].pId]=[];
        this.groups[this.tree[i].pId].push(this.tree[i]);
      }
    }
  },getDom:function(a){
    if(!a){return ''}
    var html='n<ul >n';
    for(var i=0;i<a.length;i++){
      html+='<li><a href="#">'+a[i].name+'</a>';
      html+=this.getDom(this.groups[a[i].id]);
      html+='</li>n';
    };
    html+='</ul>n';
    return html;
  }
};
var html=new treeMenu(zNodes).init(0);
alert(html);

java:

package test;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Collections;

/**
 * 多叉树类
*/
public class MultipleTree {
 public static void main(String[] args) {
 // 读取层次数据结果集列表 
 List dataList = VirtualDataGenerator.getVirtualResult(); 
 
 // 节点列表(散列表,用于临时存储节点对象)
 HashMap nodeList = new HashMap();
 // 根节点
 Node root = null;
 // 根据结果集构造节点列表(存入散列表)
 for (Iterator it = dataList.iterator(); it.hasNext();) {
  Map dataRecord = (Map) it.next();
  Node node = new Node();
  node.id = (String) dataRecord.get("id");
  node.text = (String) dataRecord.get("text");
  node.parentId = (String) dataRecord.get("parentId");
  nodeList.put(node.id,node);
 }
 // 构造无序的多叉树
 Set entrySet = nodeList.entrySet();
 for (Iterator it = entrySet.iterator(); it.hasNext();) {
  Node node = (Node) ((Map.Entry) it.next()).getValue();
  if (node.parentId == null || node.parentId.equals("")) {
  root = node;
  } else {
  ((Node) nodeList.get(node.parentId)).addChild(node);
  }
 }
 // 输出无序的树形菜单的JSON字符串
 System.out.println(root.toString());  
 // 对多叉树进行横向排序
 root.sortChildren();
 // 输出有序的树形菜单的JSON字符串
 System.out.println(root.toString()); 
 
 // 程序输出结果如下(无序的树形菜单)(格式化后的结果): 
 // {
 //  id : '100000',//  text : '廊坊银行总行',//  children : [
 //   {
 //   id : '110000',//   text : '廊坊分行',//   children : [
 //    {
 //    id : '113000',//    text : '廊坊银行开发区支行',//    leaf : true
 //    },//    {
 //    id : '111000',//    text : '廊坊银行金光道支行',//    {
 //    id : '112000',//    text : '廊坊银行解放道支行',//    children : [
 //     {
 //     id : '112200',//     text : '廊坊银行三大街支行',//     leaf : true
 //     },//     {
 //     id : '112100',//     text : '廊坊银行广阳道支行',//     leaf : true
 //     }
 //    ]
 //    }
 //   ]
 //   }
 //  ]
 // }

 // 程序输出结果如下(有序的树形菜单)(格式化后的结果):
 // {
 //  id : '100000',//   children : [
 //    {
 //    id : '111000',//    children : [
 //     {
 //     id : '112100',//     {
 //     id : '112200',//     leaf : true
 //     }
 //    ]
 //    },//    {
 //    id : '113000',//    leaf : true
 //    }
 //   ]
 //   }
 //  ]
 // } 
 
 }
  
}


/**
* 节点类
*/
class Node {
 /**
 * 节点编号
 */
 public String id;
 /**
 * 节点内容
 */
 public String text;
 /**
 * 父节点编号
 */
 public String parentId;
 /**
 * 孩子节点列表
 */
 private Children children = new Children();
 
 // 先序遍历,拼接JSON字符串
 public String toString() { 
 String result = "{"
  + "id : '" + id + "'"
  + ",text : '" + text + "'";
 
 if (children != null && children.getSize() != 0) {
  result += ",children : " + children.toString();
 } else {
  result += ",leaf : true";
 }
  
 return result + "}";
 }
 
 // 兄弟节点横向排序
 public void sortChildren() {
 if (children != null && children.getSize() != 0) {
  children.sortChildren();
 }
 }
 
 // 添加孩子节点
 public void addChild(Node node) {
 this.children.addChild(node);
 }
}

/**
* 孩子列表类
*/
class Children {
 private List list = new ArrayList();
 
 public int getSize() {
 return list.size();
 }
 
 public void addChild(Node node) {
 list.add(node);
 }
 
 // 拼接孩子节点的JSON字符串
 public String toString() {
 String result = "["; 
 for (Iterator it = list.iterator(); it.hasNext();) {
  result += ((Node) it.next()).toString();
  result += ",";
 }
 result = result.substring(0,result.length() - 1);
 result += "]";
 return result;
 }
 
 // 孩子节点排序
 public void sortChildren() {
 // 对本层节点进行排序
 // 可根据不同的排序属性,传入不同的比较器,这里传入ID比较器
 Collections.sort(list,new NodeIDComparator());
 // 对每个节点的下一层节点进行排序
 for (Iterator it = list.iterator(); it.hasNext();) {
  ((Node) it.next()).sortChildren();
 }
 }
}

/**
 * 节点比较器
 */
class NodeIDComparator implements Comparator {
 // 按照节点编号比较
 public int compare(Object o1,Object o2) {
 int j1 = Integer.parseInt(((Node)o1).id);
   int j2 = Integer.parseInt(((Node)o2).id);
   return (j1 < j2 ? -1 : (j1 == j2 ? 0 : 1));
 } 
}

/**
 * 构造虚拟的层次数据
 */
class VirtualDataGenerator {
 // 构造无序的结果集列表,实际应用中,该数据应该从数据库中查询获得;
 public static List getVirtualResult() {  
 List dataList = new ArrayList();
 
 HashMap dataRecord1 = new HashMap();
 dataRecord1.put("id","112000");
 dataRecord1.put("text","廊坊银行解放道支行");
 dataRecord1.put("parentId","110000");
 
 HashMap dataRecord2 = new HashMap();
 dataRecord2.put("id","112200");
 dataRecord2.put("text","廊坊银行三大街支行");
 dataRecord2.put("parentId","112000");
 
 HashMap dataRecord3 = new HashMap();
 dataRecord3.put("id","112100");
 dataRecord3.put("text","廊坊银行广阳道支行");
 dataRecord3.put("parentId","112000");
   
 HashMap dataRecord4 = new HashMap();
 dataRecord4.put("id","113000");
 dataRecord4.put("text","廊坊银行开发区支行");
 dataRecord4.put("parentId","110000");
   
 HashMap dataRecord5 = new HashMap();
 dataRecord5.put("id","100000");
 dataRecord5.put("text","廊坊银行总行");
 dataRecord5.put("parentId","");
 
 HashMap dataRecord6 = new HashMap();
 dataRecord6.put("id","110000");
 dataRecord6.put("text","廊坊分行");
 dataRecord6.put("parentId","100000");
 
 HashMap dataRecord7 = new HashMap();
 dataRecord7.put("id","111000");
 dataRecord7.put("text","廊坊银行金光道支行");
 dataRecord7.put("parentId","110000"); 
  
 dataList.add(dataRecord1);
 dataList.add(dataRecord2);
 dataList.add(dataRecord3);
 dataList.add(dataRecord4);
 dataList.add(dataRecord5);
 dataList.add(dataRecord6);
 dataList.add(dataRecord7);
 
 return dataList;
 } 
}

以上这篇java、js中实现无限层级的树形结构方法(类似递归)就是小编分享给大家的全部内容了,希望能给大家一个参考,也希望大家多多支持编程小技巧。

(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读