java list转换为树形



import java.util.ArrayList;
import java.util.List;


public class Tree {
	private int id;
	
	private String name;
	
	private int parentId;
	
	private List<Tree> childrens;

	public Tree(int id,String name,int parentId){
		this.id = id;
		this.name = name;
		this.parentId = parentId;
	}
	
	public int getId() {
		return id;
	}

	public void setId(int id) {
		this.id = id;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public int getParentId() {
		return parentId;
	}

	public void setParentId(int parentId) {
		this.parentId = parentId;
	}

	public List<Tree> getChildrens() {
		return childrens;
	}

	public void setChildrens(List<Tree> childrens) {
		this.childrens = childrens;
	}
	
	
	
	@Override
	public String toString() {
		return "Tree [id=" + id + ", name=" + name + ", parentId=" + parentId
				+ ", childrens=" + childrens + "]";
	}

	public static void main(String[] args) {
		Tree tree1 = new Tree(1, "顶层节点1", 0);
		Tree tree2 = new Tree(2, "顶层节点2", 0);
		Tree tree3 = new Tree(3, "顶层节点3", 0);
		
		Tree tree4 = new Tree(4, "二级节点4", 1);
		Tree tree5 = new Tree(5, "二级节点5", 2);
		Tree tree6 = new Tree(6, "二级节点6", 3);
		
		Tree tree7 = new Tree(7, "三级节点7", 4);
		Tree tree8 = new Tree(8, "三级节点8", 4);
		Tree tree9 = new Tree(9, "三级节点9", 5);
		
		List<Tree> trees = new ArrayList<Tree>();
		trees.add(tree9);
		trees.add(tree8);
		trees.add(tree7);
		trees.add(tree6);
		trees.add(tree5);
		trees.add(tree4);
		trees.add(tree3);
		trees.add(tree2);
		trees.add(tree1);

		List<Tree> rootTrees = new ArrayList<Tree>();
		for (Tree tree : trees) {
			if(tree.getParentId() == 0){
				rootTrees.add(tree);
			}
			for (Tree t : trees) {
				if(t.getParentId() == tree.getId()){
					if(tree.getChildrens() == null){
						List<Tree> myChildrens = new ArrayList<Tree>();
						myChildrens.add(t);
						tree.setChildrens(myChildrens);
					}else{
						tree.getChildrens().add(t);
					}
				}
			}
		}
		
		for (Tree tree : rootTrees) {
			System.out.println(tree.toString());
		}
		
	}

}
import java.util.ArrayList;
import java.util.List;


public class Tree {
	private int id;
	
	private String name;
	
	private int parentId;
	
	private List<Tree> childrens;

	public Tree(int id,String name,int parentId){
		this.id = id;
		this.name = name;
		this.parentId = parentId;
	}
	
	public int getId() {
		return id;
	}

	public void setId(int id) {
		this.id = id;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public int getParentId() {
		return parentId;
	}

	public void setParentId(int parentId) {
		this.parentId = parentId;
	}

	public List<Tree> getChildrens() {
		return childrens;
	}

	public void setChildrens(List<Tree> childrens) {
		this.childrens = childrens;
	}
	
	
	
	@Override
	public String toString() {
		return "Tree [id=" + id + ", name=" + name + ", parentId=" + parentId
				+ ", childrens=" + childrens + "]";
	}

	public static void main(String[] args) {
		Tree tree1 = new Tree(1, "顶层节点1", 0);
		Tree tree2 = new Tree(2, "顶层节点2", 0);
		Tree tree3 = new Tree(3, "顶层节点3", 0);
		
		Tree tree4 = new Tree(4, "二级节点4", 1);
		Tree tree5 = new Tree(5, "二级节点5", 2);
		Tree tree6 = new Tree(6, "二级节点6", 3);
		
		Tree tree7 = new Tree(7, "三级节点7", 4);
		Tree tree8 = new Tree(8, "三级节点8", 4);
		Tree tree9 = new Tree(9, "三级节点9", 5);
		
		List<Tree> trees = new ArrayList<Tree>();
		trees.add(tree9);
		trees.add(tree8);
		trees.add(tree7);
		trees.add(tree6);
		trees.add(tree5);
		trees.add(tree4);
		trees.add(tree3);
		trees.add(tree2);
		trees.add(tree1);

		List<Tree> rootTrees = new ArrayList<Tree>();
		for (Tree tree : trees) {
			if(tree.getParentId() == 0){
				rootTrees.add(tree);
			}
			for (Tree t : trees) {
				if(t.getParentId() == tree.getId()){
					if(tree.getChildrens() == null){
						List<Tree> myChildrens = new ArrayList<Tree>();
						myChildrens.add(t);
						tree.setChildrens(myChildrens);
					}else{
						tree.getChildrens().add(t);
					}
				}
			}
		}
		
		for (Tree tree : rootTrees) {
			System.out.println(tree.toString());
		}
		
	}

}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值