LeetCode Weekly Contest 40(4) - Decode Ways II

639. Decode Ways II
Difficulty: Hard
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'.

本题题意是计算反编码的种数，一位数中1-9可以反编码为字母，两位数则是10-26可以，再大的数是不行的。很容易的可以写出递推公式:f(n) = 第n个字母单独反编码种类*f(n-1) + 第n和n-1个字母组成两位数反编码的种类数*f(n-2)。所以首先计算出f(1)和f(2)，然后就能依次算出后续的f(n)，细节见注释。

// 返回单个字符的编码种类
long long getNumberOfSingle(char c) {
    if (c == '0')
        return 0;
    else if (c == '*')
        return 9;
    else {
        return 1;
    }
}
// 返回双字符组成两位数并且在26以内的编码种类
long long getNumberOfMoreThanTen(char a, char b) {
    if (a == '0')
        return 0;
    else if (a == '1') {
        if (b == '*') {
            return 9;
        }
        return 1;
    }
    else if (a == '2') {
        if (b == '*') {
            return 6;
        }
        else if (b <= '6') return 1;
        else return 0;
    }
    else if (a == '*') {
        if (b == '*') {
            return 15;
        }
        else if (b <= '6') {
            return 2;
        }
        else {
            return 1;
        }
    }
    else {
        return 0;
    }
}
// 返回双字符分别编码为字母的编码种类
long long getNumberOfSeparate(char a, char b) {
    if (a == '0' || b == '0')
        return 0;
    return getNumberOfSingle(a) * getNumberOfSingle(b);
}
int numDecodings(string s) {
    if (s.size() == 0) return 0;
    if (s.size() == 1) return getNumberOfSingle(s[0]);
    if (s.size() == 2) return getNumberOfMoreThanTen(s[0], s[1]) + getNumberOfSeparate(s[0], s[1]);
    long long a = getNumberOfSingle(s[s.size() - 1]), b = getNumberOfMoreThanTen(s[s.size() - 2], s[s.size() - 1]) + getNumberOfSeparate(s[s.size() - 2], s[s.size() - 1]);
    for (int i = s.size() - 3; i >= 0; i--) {
        // 递推公式：f(n) = getNumberOfSingle * f(n-1) + getNumberOfMoreThanTen * f(n-2)
        long long temp = (getNumberOfSingle(s[i])*b % 1000000007 + getNumberOfMoreThanTen(s[i], s[i + 1])*a % 1000000007) % 1000000007;
        a = b;
        b = temp;
    }
    return b;
}