zoukankan      html  css  js  c++  java
  • kotlin 很杂很杂

    //        // 储存具体漏期的期数的一个变量
    //        var  periodsList = mutableListOf<String>()
    //        // 如果存在漏期
    //        if (searchResult <= 0){
    //            // 则找出存在的最大期数
    //            var maxSql = """
    //                SELECT
    //                    MAX(b.periods)
    //                FROM
    //                    biz_big_periods_info a,
    //                    biz_periods_mapping_info b
    //                WHERE
    //                    a.SYS_STATUS = 1
    //                AND b.SYS_STATUS = 1
    //                AND a.core_enterprise_id = ?
    //                AND a.financial_institutions_id = ?
    //                AND a.id = b.big_periods_id
    //            """.trimIndent()
    //            if (bigPeriodsId != null) {
    //                maxSql += " AND a.id <> '" + bigPeriodsId + "'"
    //            }
    //
    //            var maxPeriods = dbp.queryInt(maxSql, coreEnterpriseId, financialInstitutionsId)
    //
    //            if (maxPeriods != null){
    //                if (maxPeriods > periodsSmall ){
    //                    for ( i in periodsSmall..maxPeriods){
    //                        if (i==maxPeriods) continue  // i 为 maxPeriods 时跳过当前循环,继续下一次循环
    //                        if (i==periodsSmall) continue  // i 为 periodsSmall 时跳过当前循环,继续下一次循环
    //                        periodsList.add(i.toString())
    //                    }
    //                }else{
    //                    for ( i in maxPeriods..periodsSmall){
    //                        if (i==maxPeriods) continue  // i 为 maxPeriods 时跳过当前循环,继续下一次循环
    //                        if (i==periodsSmall) continue  // i 为 periodsSmall 时跳过当前循环,继续下一次循环
    //                        periodsList.add(i.toString())
    //                    }
    //                }
    //
    //            }
    //
    //        }
  • 相关阅读:
    bzoj3196 Tyvj 1730 二逼平衡树
    bzoj2929 [Poi1999]洞穴攀行
    bzoj2325 [ZJOI2011]道馆之战
    cf413E Maze 2D
    bzoj2599 [IOI2011]Race
    bzoj1528 [POI2005]sam-Toy Cars
    UVA 796 Critical Links(无向图求桥)
    UVA 315 Network(无向图求割点)
    HDU 1269 迷宫城堡(求是否只有一个强连通分量)
    HDU 3974 Assign the task
  • 原文地址:https://www.cnblogs.com/xiaoniuniu886/p/11088741.html
Copyright © 2011-2022 走看看