笔记-递归查询

根据子id查询父id

    private  Integer  getFaIdBySonIdNew(List<MedicalOrganEntity> list,Integer id) {
        for (MedicalOrganEntity one : list) {
            Integer faId = one.getId();
            if (faId.equals(id)) {
                Integer regionType = one.getRegionType();
                if(regionType == 1){
                    return faId;
                }else{
                    Integer parentId = one.getParentId();
                    return  getFaIdBySonIdNew(list, parentId);
                }
            } else {
                continue;
            }
        }
        return null;
    }

根据树List<MedicalOrganEntity>和id查询以id为开始的树

    private  MedicalOrganEntity  getStartEntity(List<MedicalOrganEntity> list,Integer id) {
        MedicalOrganEntity medicalOrganEntity =new MedicalOrganEntity();
        for (MedicalOrganEntity one : list) {
            if (!one.getId().equals(id)) {
                if (!CollectionUtils.isEmpty(one.getMedicalOrganEntityList())) {
                    medicalOrganEntity = getStartEntity(one.getMedicalOrganEntityList(), id);
                    if(medicalOrganEntity == null){
                        continue;
                    }else {
                        return medicalOrganEntity;
                    }
                } else {
                    continue;
                }
            } else {
                return one;
            }
        }
        return null;
    }


版权声明:本文为weixin_40912627原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。