g0801_0900.s0879_profitable_schemes.Solution.kt Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.28

package g0801_0900.s0879_profitable_schemes

// #Hard #Array #Dynamic_Programming #2023_04_08_Time_198_ms_(75.00%)_Space_35.5_MB_(100.00%)

class Solution {
    fun profitableSchemes(n: Int, minProfit: Int, group: IntArray, profit: IntArray): Int {
        val dp = Array(n + 1) { LongArray(minProfit + 1) }
        val modulus = 1000000007L
        for (i in dp.indices) {
            dp[i][0] = 1
        }
        for (i in group.indices) {
            val currWorker = group[i]
            val currProfit = profit[i]
            for (j in dp.size - 1 downTo currWorker) {
                for (k in dp[j].indices.reversed()) {
                    dp[j][k] = (
                        (dp[j][k] + dp[j - currWorker][(k - currProfit).coerceAtLeast(0)]) %
                            modulus
                        )
                }
            }
        }
        return dp[n][minProfit].toInt()
    }
}