639. Decode Ways II

Source: https://leetcode.com/problems/decode-ways-ii/

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

‘A’ -> 1
‘B’ -> 2
…
‘Z’ -> 26
Beyond that, now the encoded string can also contain the character ‘*’, which can be treated as one of the numbers from 1 to 9.

Given the encoded message containing digits and the character ‘*’, return the total number of ways to decode it.

Also, since the answer may be very large, you should return the output mod 109 + 7.

Example 1:
Input: “"
Output: 9
Explanation: The encoded message can be decoded to the string: “A”, “B”, “C”, “D”, “E”, “F”, “G”, “H”, “I”.
Example 2:
Input: "1”
Output: 9 + 9 = 18
Note:
The length of the input string will fit in range [1, 105].
The input string will only contain the character ‘*’ and digits ‘0’ - ‘9’.

思路：DP
跟之前一题比，多了一种超级字符’*’，可以转化成1-9任意数字，就像万能福。相应的需要讨论更多种的情况。

还需要注意乘以9或6或15会越int界，要先转成long long，取模之后转回int。

class Solution {
public:
    typedef long long ll;
    int mod=1e9+7;
    int numDecodings(string s) {
        int n=s.length();
        if(n==0)
            return 0;
        vector<int> dp(n,0);
        
        if(s[0]=='0')
            dp[0]=0;
        else if(s[0]=='*')
            dp[0]=9;
        else
            dp[0]=1;
        if(n==1)
            return dp[0];
        
        for(int i=1;i<n;i++){
            if(s[i]>='1' && s[i]<='9'){
                dp[i]=(dp[i]+dp[i-1])%mod;
            }
            else if(s[i]=='*'){
                dp[i]=(dp[i]+(int)(9*(ll)dp[i-1]%mod))%mod;
            }
            
            int tmp;
            if(i>1){
                tmp=dp[i-2];
            }
            else{
                tmp=1;
            }
            
            if(s[i-1]!='*' && s[i]!='*'){
                if((s[i-1]-'0')*10+s[i]-'0'>=10 && (s[i-1]-'0')*10+s[i]-'0'<=26){
                    dp[i]=(dp[i]+tmp)%mod;
                }
            }
            else if(s[i]=='*' && s[i-1]=='1'){
                dp[i]=(dp[i]+(int)(9*(ll)tmp%mod))%mod;
            }
            else if(s[i]=='*' && s[i-1]=='2'){
                dp[i]=(dp[i]+(int)(6*(ll)tmp%mod))%mod;
            }
            else if(s[i-1]=='*' && s[i]>='0' && s[i]<='6'){
                dp[i]=(dp[i]+(int)(2*(ll)tmp%mod))%mod;
            }
            else if(s[i-1]=='*' && s[i]>='7' && s[i]<='9'){
                dp[i]=(dp[i]+tmp)%mod;
            }
            else if(s[i-1]=='*' && s[i]=='*'){
                dp[i]=(dp[i]+(int)(15*(ll)tmp%mod))%mod;
            }
            // cout<<dp[i]<<endl;
        }
        return dp[n-1];
    }
};