递归

public boolean checkJieDian(Catalog catalogNow, Catalog catalogMove) {

    CatalogService s = new CatalogService();
    
        if(catalogMove==null){
            log.info("最后还是没有找到，那么就返回");
            return true;
        }
    
    catalogMove = s.getCatalog(catalogMove.getId());

    // 如果目标分类有父级
    if (catalogMove.getParentCatalog() != null) {
        // 取得父级
        Catalog parentCatalogMove = catalogMove.getParentCatalog();

        // 如果目标分类为现有分类的父
        // 看看父中ID和现有是否相等，如果相等，现有的属于移动的父
        if (parentCatalogMove.getId() == catalogNow.getId()) {
        log.info("parentCatalogMove.getId():"+parentCatalogMove.getId());
        log.info("catalogNow.getId():"+catalogNow.getId());
        log.info("父类不能移动到子类！！！！！！！！！！！");
        return false;
        }
        else {
        log.info("进入递归");
        // 否则，移动再取父 ,再次去数据库取得，避免溢出，避免-no session
        parentCatalogMove = s.getCatalog(parentCatalogMove.getId());
        return  this.checkJieDian(catalogNow, parentCatalogMove);
                                
        }
    }
    
    if (catalogMove.getParentCatalog() == null) {
        return true;
    }
    return true;
    }