class Solution:
def solve(self, nums: str) -> int:
n = len(nums)
if n == 0:
return 0
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if nums[0] != "0" else 0
for i in range(2, n + 1):
if nums[i - 1] != "0":
dp[i] += dp[i - 1]
if "10" <= nums[i - 2 : i] <= "26":
dp[i] += dp[i - 2]
return dp[n]

京公网安备 11010502036488号