leetcode 面试题46把数字翻译成字符串

解题思路:动态规划，（1）得到num的每一位数字,从低位到高位用nums保存（2）从低位到高位依次求解，状态转移方程如下：
$$dp[i]=\{\begin{array}{lr}dp[i-1]+dp[i-2]& 10\le (nums[i]\ast 10+nums[i-1)<26\\ dp[i-1]& others\end{array}$$
dp[i]表示低（i+1）位可以表示的字符串个数
代码如下：

class Solution:
   def translateNum(self, num: int) -> int:
       if num < 10:
           return 1
       nums = []
       while(num):
           nums.append(num % 10)
           num //= 10
       size = len(nums)
       a1, a2 = 1, 1
       for i in range(1,size):
           if 10 <= (nums[i]*10 + nums[i-1]) < 26:
               tmp = a1 + a2
           else:
               tmp = a1
           a2 = a1
           a1 = tmp
       return a1