解码方式

题目

A message containing letters from A-Z is being encoded to numbers using the following mapping:

‘A’ -> 1

‘B’ -> 2

…

‘Z’ -> 26

Given an encoded message containing digits, determine the total number of ways to decode it.

Input: “12”

Output: 2

Explanation: It could be decoded as “AB” (1 2) or “L” (12).
Input: “226”

Output: 3

Explanation: It could be decoded as “BZ” (2 26), “VF” (22 6), or “BBF” (2 2 6).

思路

这题的限制条件是1-26，所以只有一个数字和两个数字的组合方式，故
fn=fn-1 + fn-2

代码

def code_way(s):
  dp = [0] * (len(s)+1)
  dp[0] = dp[1] =1
  for i in range(2,len(s)+1):
    if 10<=int(s[i-2:i])<=26 and int(s[i-1])!=0:
      dp[i] = dp[i-1] + dp[i-2]
    elif 10<=int(s[i-2:i])<=26:
      dp[i] = dp[i-2]
    elif int(s[i-1])!=0:
      dp[i] = dp[i-1]
  return dp[-1]