java递归树

 

首先实体类如下:

public class Entity

{

private String id;

private String groupName;

private String pid;

private boolean checkGroup;

private List<Entity> children;

public Entity(String id, String groupName, String pid, boolean checkGroup) {

super();

this.id = id;

this.groupName = groupName;

this.pid = pid;

this.checkGroup = checkGroup;

}

public String getId() {

return id;

}

public void setId(String id) {

this.id = id;

}

public String getGroupName() {

return groupName;

}

public void setGroupName(String groupName) {

this.groupName = groupName;

}

public String getPid() {

return pid;

}

public void setPid(String pid) {

this.pid = pid;

}

public boolean isCheckGroup() {

return checkGroup;

}

public void setCheckGroup(boolean checkGroup) {

this.checkGroup = checkGroup;

}

public List<Entity> getChildren() {

return children;

}

public void setChildren(List<Entity> children) {

this.children = children;

}

}


生成树形结构的类如下:

public class EneityUtil {

public static List<Entity> getResult(List<Entity> src)

{

List<Entity> parents = new ArrayList<Entity>();

for(Entity ent : src)

{

if(ent.isCheckGroup())

{

Entity result = ent;

result.setChildren(new ArrayList<Entity>());

parents.add(result);

}

}

List<Entity> last = new ArrayList<Entity>();

for(Entity ent : src)

{

if(!ent.isCheckGroup())

{

last.add(ent);

}

}

buildTree(parents, last);

return parents;

}

private static void buildTree(List<Entity> parents, List<Entity> others)

{

List<Entity> record = new ArrayList<Entity>();

for(Iterator<Entity> it = parents.iterator(); it.hasNext();)

{

Entity vi = it.next();

if(vi.getId() != null)

{

for(Iterator<Entity> otherIt = others.iterator(); otherIt.hasNext();)

{

Entity inVi = otherIt.next();

if(vi.getId().equals(inVi.getPid()))

{

if(null == vi.getChildren())

{

vi.setChildren(new ArrayList<Entity>());

}

vi.getChildren().add(inVi);

record.add(inVi);

otherIt.remove();

}

}

}

}

if(others.size() == 0)

{

return;

}

else

{

buildTree(record, others);

}

}

@SuppressWarnings("all")

public static void main(String[] args) {

List<Entity> src = new ArrayList<Entity>();

Entity ent0 = new Entity("0", "ALL", null, true);

Entity ent1 = new Entity("1", "中国", "0" , false);

Entity ent2 = new Entity("11", "YY", "1" , false);

Entity ent3 = new Entity("111", "XX", "11", false);

Entity ent6 = new Entity("1111", "ZZ", "111", false);

Entity ent4 = new Entity("2", "美国", "0" , false);

Entity ent5 = new Entity("21", "华盛顿", "2" , false);

src.add(ent0);

src.add(ent1);

src.add(ent2);

src.add(ent3);

src.add(ent4);

src.add(ent5);

src.add(ent6);

List<Entity> result = getResult(src);

System.out.println(result.size());

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
无限级Java递归) 2007-02-08 10:26 这几天,用java写了一个无限极的递归写的,可能代码不够简洁,性能不够好,不过也算是练习,这几天再不断改进。前面几个小图标的判断,搞死我了。 package com.nickol.servlet; import java.io.IOException; import java.io.PrintWriter; import java.sql.Connection; import java.sql.PreparedStatement; import java.sql.ResultSet; import java.util.ArrayList; import javax.servlet.ServletException; import javax.servlet.http.HttpServlet; import javax.servlet.http.HttpServletRequest; import javax.servlet.http.HttpServletResponse; import com.nickol.utility.DB; public class category extends HttpServlet { /** * The doGet method of the servlet. * * This method is called when a form has its tag value method equals to get. * * @param request the request send by the client to the server * @param response the response send by the server to the client * @throws ServletException if an error occurred * @throws IOException if an error occurred */ public void doGet(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException { response.setCharacterEncoding("utf-8"); response.setContentType("text/html"); PrintWriter out = response.getWriter(); out .println(""); out.println(""); out.println(" Category" + "" + "body{font-size:12px;}" + "" + "" + ""); out.println(" "); out.println(showCategory(0,0,new ArrayList(),"0")); out.println(" "); out.println(""); out.flush(); out.close(); } public String showCategory(int i,int n,ArrayList frontIcon,String countCurrent){ int countChild = 0; n++; String webContent = new String(); ArrayList temp = new ArrayList(); try{ Connection conn = DB.GetConn(); PreparedStatement ps = DB.GetPs("select * from category where pid = ?", conn); ps.setInt(1, i); ResultSet rs = DB.GetRs(ps); if(n==1){ if(rs.next()){ webContent += "";//插入结尾的减号 temp.add(new Integer(0)); } webContent += " ";//插入站点图标 webContent += rs.getString("cname"); webContent += "\n"; webContent += showCategory(Integer.parseInt(rs.getString("cid")),n,temp,"0"); } if(n==2){ webContent += "\n"; }else{ webContent += "\n"; } while(rs.next()){ for(int k=0;k<frontIcon.size();k++){ int iconStatic = ((Integer)frontIcon.get(k)).intValue(); if(iconStatic == 0){ webContent += "";//插入空白 }else if(iconStatic == 1){ webContent += "";//插入竖线 } } if(rs.isLast()){ if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += "";//插入结尾的减号 temp = (ArrayList)frontIcon.clone(); temp.add(new Integer(0)); }else{ webContent += "";//插入结尾的直角 } }else{ if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += "";//插入未结尾的减号 temp = (ArrayList)frontIcon.clone(); temp.add(new Integer(1)); }else{ webContent += "";//插入三叉线 } } if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += " ";//插入文件夹图标 }else{ webContent += " ";//插入文件图标 } webContent += rs.getString("cname"); webContent += "\n"; webContent += showCategory(Integer.parseInt(rs.getString("cid")),n,temp,countCurrent+countChild); countChild++; } webContent += "\n"; DB.CloseRs(rs); DB.ClosePs(ps); DB.CloseConn(conn); }catch(Exception e){ e.printStackTrace(); } return webContent; } public boolean checkChild(int i){ boolean child = false; try{ Connection conn = DB.GetConn(); PreparedStatement ps = DB.GetPs("select * from category where pid = ?", conn); ps.setInt(1, i); ResultSet rs = DB.GetRs(ps); if(rs.next()){ child = true; } DB.CloseRs(rs); DB.ClosePs(ps); DB.CloseConn(conn); }catch(Exception e){ e.printStackTrace(); } return child; } } --------------------------------------------------------------------- tree.js文件 function changeState(countCurrent,countChild){ var object = document.getElementById("level" + countCurrent + countChild); if(object.style.display=='none'){ object.style.display='block'; }else{ object.style.display='none'; } var cursor = document.getElementById("cursor" + countCurrent + countChild); if(cursor.src.indexOf("images/tree_minus.gif")>=0) {cursor.src="images/tree_plus.gif";} else if(cursor.src.indexOf("images/tree_minusbottom.gif")>=0) {cursor.src="images/tree_plusbottom.gif";} else if(cursor.src.indexOf("images/tree_plus.gif")>=0) {cursor.src="images/tree_minus.gif";} else {cursor.src="images/tree_minusbottom.gif";} var folder = document.getElementById("folder" + countCurrent + countChild); if(folder.src.indexOf("images/icon_folder_channel_normal.gif")>=0){ folder.src = "images/icon_folder_channel_open.gif"; }else{ folder.src = "images/icon_folder_channel_normal.gif"; }

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值