[Leetcode] 639. 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:

1. The length of the input string will fit in range [1, 105].
2. The input string will only contain the character '*' and digits '0' - '9'.

思路：

动态规划问题：我们定义dp[i]表示s的前i个字符所构成的字符串的decode个数，那么可以分为两种情况进行讨论：

1）s[i - 1]独立decode，假设有x1种方法，则整个decode的方法个数是x1 * dp[i - 1]；

2）s[i - 1]和s[i - 2]合起来进行decode，假设有x2种方法，则整个decode的方法个数是x2 * dp[i - 2]。

因此，dp[i] = x1 * dp[i - 1] + x2 * dp[i - 2]。在这个递推公式中，dp[i]之和dp[i - 1], dp[i - 2]有关，所以空间复杂度还可以进一步优化到O(1)。时间复杂度是O(n)。具体实现请见下面的代码片段。

代码：

class Solution {
public:
    int numDecodings(string s) {
        int n = s.size();
        // f2 is the answer to sub string ending at position i; Initially i = 0.
        long f1 = 1, f2 = helper(s.substr(0,1));
        // DP to get f2 for sub string ending at position n-1;
        for (int i = 1; i < n; i++) {
            long f3 = f2 * helper(s.substr(i, 1)) + f1 * helper(s.substr(i - 1, 2));
            f1 = f2;
            f2 = f3 % 1000000007;
        }
        return f2;
    }
private:
    int helper(string s) {
        if (s.size() == 1) {
            if (s[0] == '*') {
                return 9;
            }
            return s[0] == '0'? 0 : 1;
        }
        if (s == "**") {            // 11-19, 21-26
            return 15;
        }
        else if (s[1] =='*') {
            if (s[0] =='1') {       // 11-19
                return 9;
            }
            return s[0] == '2'? 6 : 0;
        }
        else if (s[0] == '*') {     // 2x or 1x
            return s[1] <= '6'? 2 : 1;
        }
        else {
            return stoi(s) >= 10 && stoi(s) <= 26? 1 : 0; 
        }
    }
};