Leetcode 639.解码方法 2
1 题目描述(Leetcode题目链接)
一条包含字母 A-Z 的消息通过以下的方式进行了编码:
'A' -> 1
'B' -> 2
...
'Z' -> 26
除了上述的条件以外,现在加密字符串可以包含字符 '‘了,字符’'可以被当做1到9当中的任意一个数字。
给定一条包含数字和字符’*'的加密信息,请确定解码方法的总数。
同时,由于结果值可能会相当的大,所以你应当对109 + 7取模。(翻译者标注:此处取模主要是为了防止溢出)
输入: "*"
输出: 9
解释: 加密的信息可以被解密为: "A", "B", "C", "D", "E", "F", "G", "H", "I".
输入: "1*"
输出: 9 + 9 = 18(翻译者标注:这里1*可以分解为1,* 或者当做1*来处理,所以结果是9+9=18)
说明 :
- 输入的字符串长度范围是 [1, 105]。
- 输入的字符串只会包含字符 ‘*’ 和 数字’0’ - ‘9’。
2 题解
分情况讨论,写得比较冗余,但还是比较清晰的。
class Solution:
def numDecodings(self, s: str) -> int:
n = len(s)
dp = [0]*(n+1)
if s[0] == '0':
return 0
if s[0] == "*":
dp[0] = 1
dp[1] = 9
else:
dp[0] = dp[1] = 1
for i in range(2, n+1):
if s[i-2] == "0":
if s[i-1] == "*":
dp[i] = 9*dp[i-1]
elif s[i-1] == "0":
dp[i] = 0
else:
dp[i] = dp[i-1]
elif s[i-2] == "1":
if s[i-1] == "*":
dp[i] = 9*dp[i-1] + 9*dp[i-2]
elif s[i-1] == "0":
dp[i] = dp[i-2]
else:
dp[i] = dp[i-1] + dp[i-2]
elif s[i-2] == "2":
if s[i-1] == "*":
dp[i] = 9*dp[i-1] + 6*dp[i-2]
elif s[i-1] == "0":
dp[i] = dp[i-2]
elif s[i-1] <= "6":
dp[i] = dp[i-1] + dp[i-2]
else:
dp[i] = dp[i-1]
elif s[i-2] == "*":
if s[i-1] == "*":
dp[i] = 9*dp[i-1] + 15*dp[i-2]
elif s[i-1] == "0":
dp[i] = 2*dp[i-2]
elif s[i-1] <= "6":
dp[i] = dp[i-1] + 2*dp[i-2]
else:
dp[i] = dp[i-1] + dp[i-2]
else:
if s[i-1] == "*":
dp[i] = 9*dp[i-1]
elif s[i-1] == "0":
dp[i] = 0
else:
dp[i] = dp[i-1]
return dp[-1] % 1000000007