700字范文,内容丰富有趣,生活中的好帮手!
700字范文 > 如何利用递归算法以及数据库解析成Java树形结构的代码解析

如何利用递归算法以及数据库解析成Java树形结构的代码解析

时间:2019-10-31 15:35:06

相关推荐

如何利用递归算法以及数据库解析成Java树形结构的代码解析

Java|java教程

以及,算法,递归

Java-java教程1、准备表结构及对应的表数据

在线电影网站源码,vscode加粗,ubuntu 误删恢复,tomcat邮件,sqlite 事务 最大,iis 重启服务器,js捕获上下键 插件,目前前端开发框架,java爬虫爬取图片,php太难,波分seo吧,qq号出售网站源码,网页下载 chm,单页设计模板,仿京东登录和注册页面,wap 管理系统模板下载,仿hao123漫画程序lzw

a、表结构:

易语言改开机密码源码,vscode添加背景图,ubuntu 网络重置,tomcat 日志不打印,利哥爬虫,php 5.5.1 下载,黑帽seo 站群赚钱,asp景点网站源码,自愿由第三方支付模板lzw

create table TB_TREE(CID NUMBER not null,CNAME VARCHAR2(50),PID NUMBER //父节点)

b、表数据:

易语言搜狗输入法源码,知乎vscode配置c,Ubuntu代码关机,把项目放到tomcat,捕获网页爬虫,php 字符型注入,龙岩seo关键词排名,网站整站源程序,dz同城门户模板lzw

insert into tb_tree (CID, CNAME, PID) values (1, 中国, 0);insert into tb_tree (CID, CNAME, PID) values (2, 北京市, 1);insert into tb_tree (CID, CNAME, PID) values (3, 广东省, 1);insert into tb_tree (CID, CNAME, PID) values (4, 上海市, 1);insert into tb_tree (CID, CNAME, PID) values (5, 广州市, 3);insert into tb_tree (CID, CNAME, PID) values (6, 深圳市, 3);insert into tb_tree (CID, CNAME, PID) values (7, 海珠区, 5);insert into tb_tree (CID, CNAME, PID) values (8, 天河区, 5);insert into tb_tree (CID, CNAME, PID) values (9, 福田区, 6);insert into tb_tree (CID, CNAME, PID) values (10, 南山区, 6);insert into tb_tree (CID, CNAME, PID) values (11, 密云县, 2);insert into tb_tree (CID, CNAME, PID) values (12, 浦东, 4);

2、TreeNode对象,对应tb_tree

public class TreeNode implements Serializable {private Integer cid;private String cname;private Integer pid;private List nodes = new ArrayList();public TreeNode() {}//getter、setter省略}

3、测试数据

public class TreeNodeTest {@Testpublic void loadTree() throws Exception{System.out.println(JsonUtils.javaToJson(recursiveTree(1)));}/*** 递归算法解析成树形结构** @param cid* @return* @author jiqinlin*/public TreeNode recursiveTree(int cid) {//根据cid获取节点对象(SELECT * FROM tb_tree t WHERE t.cid=?)TreeNode node = personService.getreeNode(cid);//查询cid下的所有子节点(SELECT * FROM tb_tree t WHERE t.pid=?)List childTreeNodes = personService.queryTreeNode(cid); //遍历子节点for(TreeNode child : childTreeNodes){TreeNode n = recursiveTree(child.getCid()); //递归node.getNodes().add(n);}return node;}}

输出的json格式如下:

{ "cid": 1, "nodes": [ {"cid": 2,"nodes": [ {"cid": 11,"nodes": [],"cname": "密云县","pid": 2 }],"cname": "北京市","pid": 1 }, {"cid": 3,"nodes": [ {"cid": 5,"nodes": [ { "cid": 7, "nodes": [ ], "cname": "海珠区", "pid": 5 }, { "cid": 8, "nodes": [ ], "cname": "天河区", "pid": 5 }],"cname": "广州市","pid": 3 }, {"cid": 6,"nodes": [ { "cid": 9, "nodes": [ ], "cname": "福田区", "pid": 6 }, { "cid": 10, "nodes": [ ], "cname": "南山区", "pid": 6 }],"cname": "深圳市","pid": 3 }],"cname": "广东省","pid": 1 }, {"cid": 4,"nodes": [ {"cid": 12,"nodes": [],"cname": "浦东","pid": 4 }],"cname": "上海市","pid": 1 } ], "cname": "中国", "pid": 0}

总结

本内容不代表本网观点和政治立场,如有侵犯你的权益请联系我们处理。
网友评论
网友评论仅供其表达个人看法,并不表明网站立场。