LeetCode091. Decode Ways python

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

'A' -> 1
'B' -> 2
...
'Z' -> 26

Given a non-empty string containing only digits, determine the total number of ways to decode it.

Example 1:

Input: "12"
Output: 2
Explanation: It could be decoded as "AB" (1 2) or "L" (12).
Example 2:

Input: "226"
Output: 3
Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).

---

同样是一道动态规划问题.

对于每一个新的单个数字dp[i],如果dp[i] != 0,那一定有一种组合方式为=前面所有组合方法

对于每一个新的单个数字dp[i],如果dp[i-2,i]可以组合成符合要求的数字(1-26),那他的组合方式+=dp[i-2]前面所有组合方法

class Solution(object):
    def numDecodings(self, s):
        """
        :type s: str
        :rtype: int
        """
        if len(s)==0:return 0
        dp = [0 for i in range(len(s)+1)]
        dp[0]=1
        
        for i in range(1, len(s)+1):
            if s[i-1]!='0':
                dp[i] += dp[i-1]
            if i>1 and s[i-2:i]<'27' and s[i-2:i]>'09':
                dp[i]+= dp[i-2]
        return dp[-1]

clpython中字符串也可以比较大小,具体为比较字符串首位,如果相同则继续向下比较.

字母大于数字

如果一个有字符,一个没有字符,则有字符的较大.

>>> '2'>'1234'
True
>>> 'asdf'>'a'
True
>>> '2345'>'2'
True
>>> 'a'>'232'
True