给定一个数字,我们按照如下规则把它翻译为字符串:0 翻译成 “a” ,1 翻译成 “b”,……,11 翻译成 “l”,……,25 翻译成 “z”。
一个数字可能有多个翻译。请编程实现一个函数,用来计算一个数字有多少种不同的翻译方法。
示例 1:
输入: 12258
输出: 5
解释: 12258有5种不同的翻译,分别是"bccfi", "bwfi", "bczi", "mcfi"和"mzi"
回溯
class Solution:
def translateNum(self, num: int) -> int:
num = str(num)
res = []
def backtrack(cnt, conditional):
if len(conditional)<=1:
cnt += 1
return cnt
if conditional[:2]<='25' and conditional[0]!='0':
return backtrack(cnt, conditional[1:]) + backtrack(cnt, conditional[2:])
else:
return backtrack(cnt, conditional[1:])
return backtrack(0, num)
动态规划
class Solution(object):
def translateNum(self, num):
"""
:type num: int
:rtype: int
动态规划
"""
str_num = str(num)
str_num = '0' + str_num
dp = [0] * len(str_num)
dp[0] = 1
for i in range(1, len(str_num)):
dp[i] = dp[i-1]
if str_num[i-1]!='0' and str_num[i-1:i+1]<='25':
dp[i] += dp[i-2]
return dp[-1]