639. 解码方法 II
方法一:分类讨论(分成最后由一个字符或者两个字符构成)
class Solution {
public:
int numDecodings(string s) {
int n = s.size(), mod = 1e9 + 7;
s = ' ' + s;
vector<long> f(n + 1);
f[0] = 1;
for (int i = 1; i <= n; i ++ ) {
if (s[i] == '*') {
f[i] = (f[i] + f[i - 1] * 9) % mod;
}
else if (s[i] != '0') f[i] = (f[i] + f[i - 1]) % mod;
if (i > 1) {
if (s[i] == '*') {
if (s[i - 1] == '1') f[i] = (f[i] + f[i - 2] * 9) % mod;
else if (s[i - 1] == '2') f[i] = (f[i] + f[i - 2] * 6) % mod;
else if (s[i - 1] == '*') f[i] = (f[i] + f[i - 2] * 15) % mod;
}
else {
int b = (s[i - 1] - '0') * 10 + s[i] - '0';
if (b >= 10 && b <= 26) f[i] = (f[i] + f[i - 2]) % mod;
else if (s[i - 1] == '*') {
if (s[i] >= '0' && s[i] <= '6') f[i] = (f[i] + f[i - 2] * 2) % mod;
else if (s[i] >= '7' && s[i] <= '9') f[i] = (f[i] + f[i - 2]) % mod;
}
}
}
}
return f[n];
}
};
方法二:字符串匹配
枚举26个字母,依次和最后的两个字符匹配如果匹配成功答案++
class Solution {
public:
int numDecodings(string s) {
int n = s.size(), mod = 1e9 + 7;
s = ' ' + s;
vector<long long> f(n + 1);
f[0] = 1;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= 26; j ++ ) {
char a = s[i];
if (j <= 9) {
if (a == '*' || a == j + '0') f[i] += f[i - 1];
}
else if (i > 1) {
char b = s[i - 1];
int y = j / 10, x = j % 10;
if ((b == y + '0' || b == '*' && y) && (a == x + '0' || a == '*' && x))
f[i] += f[i - 2];
}
f[i] %= mod;
}
return f[n];
}
};