g0001_0100.s0091_decode_ways.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 g0001_0100.s0091_decode_ways

// #Medium #Top_Interview_Questions #String #Dynamic_Programming
// #Algorithm_II_Day_15_Dynamic_Programming #Dynamic_Programming_I_Day_10
// #2023_07_10_Time_148_ms_(79.07%)_Space_34_MB_(82.56%)

class Solution {
    fun numDecodings(s: String): Int {
        if (s[0] == '0') {
            return 0
        }
        val n = s.length
        val f = IntArray(n + 1)
        // Auxiliary
        f[0] = 1
        f[1] = 1
        for (i in 2..n) {
            // Calculate the independent number
            if (s[i - 1] != '0') {
                // As long as the current character is not 0, it means that the previous decoding
                // number can be inherited
                f[i] = f[i - 1]
            }
            // Calculate the number of combinations
            val twodigits = (s[i - 2] - '0') * 10 + (s[i - 1] - '0')
            if (twodigits >= 10 && twodigits <= 26) {
                f[i] += f[i - 2]
            }
        }
        return f[n]
    }
}