题目大意
给定两个字符串a,b,要求判断a是否能匹配b,其中b中存在两类特殊字符’.’和’*’。
”’ 匹配任何单个字符。
‘*’匹配零个或多个前面的元素。
关于’*’:
“ab” maches “a*b”;
“aaaaaa” maches “a*”;
“cab” maches “c*a*b”;
解题思路
从题目给的标签来看可以用回溯和动态规划来解题。解体的关键是如何处理字符’‘,对于字符’.’可以匹配任意一个字符容易处理,而字符’‘可以匹配多个重复字符稍微复杂一些。
对于回溯算法根据b中第二个字符是否为’‘可分为两种情况,当第二个字符为’‘时,可将b从第二个字符处截断在继续判断isMatch(a, b.substr(2))
也可根据a,b字符串地一个字符是否相同来增加’‘前的字符即x == xx*isMatch(a.substr(1), b)
。若b字符串中第二个字符不为’*’则直接根据a,b中第一个字符是否相等来分割即可isMatch(a.substr(1), b.substr(1)
。完整代码如下:
bool isMatch(string s, string p) {
if (p.empty()) return s.empty();
if ('*' == p[1])
// x* matches empty string or at least one character: x* -> xx*
// *s is to ensure s is non-empty
return (isMatch(s, p.substr(2)) || !s.empty() && (s[0] == p[0] || '.' == p[0]) && isMatch(s.substr(1), p));
else
return !s.empty() && (s[0] == p[0] || '.' == p[0]) && isMatch(s.substr(1), p.substr(1));
}
对于动态规划算法另dp[i][j]表示为a[0..i-1], p[0..j-1]是否匹配,则可一根据b[j-1]是否为字符’*’来列出转移状态方程:
b[j - 1] != '*':
f[i][j] = f[i - 1][j - 1] && (a[i - 1] == b[j - 1] || '.' == b[j - 1]);
b[j - 1] !== '*':
f[i][j] = f[i][j - 2] || (a[i - 1] == b[j - 2] || '.' == b[j - 2]) && f[i - 1][j];
完整代码如下:
bool isMatch(string s, string p) {
/**
* f[i][j]: if s[0..i-1] matches p[0..j-1]
* if p[j - 1] != '*'
* f[i][j] = f[i - 1][j - 1] && s[i - 1] == p[j - 1]
* if p[j - 1] == '*', denote p[j - 2] with x
* f[i][j] is true iff any of the following is true
* 1) "x*" repeats 0 time and matches empty: f[i][j - 2]
* 2) "x*" repeats >= 1 times and matches "x*x": s[i - 1] == x && f[i - 1][j]
* '.' matches any single character
*/
int m = s.size(), n = p.size();
vector<vector<bool>> f(m + 1, vector<bool>(n + 1, false));
f[0][0] = true;
for (int i = 1; i <= m; i++)
f[i][0] = false;
// p[0.., j - 3, j - 2, j - 1] matches empty iff p[j - 1] is '*' and p[0..j - 3] matches empty
for (int j = 1; j <= n; j++)
f[0][j] = j > 1 && '*' == p[j - 1] && f[0][j - 2];
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++)
if (p[j - 1] != '*')
f[i][j] = f[i - 1][j - 1] && (s[i - 1] == p[j - 1] || '.' == p[j - 1]);
else
// p[0] cannot be '*' so no need to check "j > 1" here
f[i][j] = f[i][j - 2] || (s[i - 1] == p[j - 2] || '.' == p[j - 2]) && f[i - 1][j];
return f[m][n];
}