java 获取叶子节点

List<Building> buildings = buildingService.getBuildingByCommunityId(Long.valueOf(communityId));
if (0!=buildings.size())
{
fIterator<Building> iterator = buildings.iterator();
while (iterator.hasNext()) {
    Building building = iterator.next();
            //为null的为父节点
           if (null==building.getParentId()) {
              getNode(wxBuildings,buildings, building);
           }
       }

}

 /**
 * 获取叶子节点
 * @param wxBuildings
 * @param buildings
 * @param building
 */
private void getNodes(List<com.wehome.wx.me.domain.Building> wxBuildings, List<Building> buildings, Building building) {
       List<Building> childList = getChildList(buildings, building);// 得到子节点列表
       if (0!=childList.size()) {// 判断是否有子节点
           Iterator<Building> it = childList.iterator();
           while (it.hasNext()) {
            Building n = (Building) it.next();
               getNodes(wxBuildings,buildings, n);
           }
       } else {
        com.wehome.wx.me.domain.Building wxBuilding = new com.wehome.wx.me.domain.Building();
        wxBuilding.setId(String.valueOf(building.getId()));
        wxBuilding.setName(building.getBuildingFullName());
        wxBuildings.add(wxBuilding);
       }
   }
    
   // 得到子节点列表
   private List<Building> getChildList(List<Building> buildings, Building building) {
       List<Building> nodeList = new ArrayList<Building>();
       Iterator<Building> it = buildings.iterator();
       while (it.hasNext()) {
        Building n = (Building) it.next();
           if (n.getParentId() == building.getId()) {
               nodeList.add(n);
           }
       }
       return nodeList;
   }

  • 1
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值