1.
2. 记dp[i][j]表示前i个源字符与前j个模式串字符是否匹配(含当前i,j
这两个字符)
class Solution {
public:
bool isMatch(string s, string p) {
int len1 = s.length(), len2 = p.length();
vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1, 0));
//dp代表前i字符串,前j匹配串.
//两者为空即为true.
dp[0][0] = 1;
for (int j = 2; j <= len2; j++)
//第j个字符下标为j-1.
if (p[j - 1] == '*' && j>=2)
//字符串为空,匹配串只有含有*才有可能true,
//其他情况都为false.
dp[0][j] = dp[0][j - 2];
for (int i = 1; i <= len1; i++) {
for (int j = 1; j <= len2; j++) {
if (s[i-1] == p[j-1] || p[j-1] == '.') {
dp[i][j] = dp[i - 1][j - 1];
}
else if (p[j - 1] == '*' && j>=2) {
if (s[i - 1] == p[j - 2] || p[j - 2] == '.') {
dp[i][j] = dp[i - 1][j] || dp[i-1][j - 2]||dp[i][j-2];
}
else
dp[i][j] = dp[i][j-2];
}
}
}
return dp[len1][len2];
}
};
3. 记源字符串长为N,模式串长为M
时间复杂度:O(MN),因为对每个源字符串都要对应比较模式串的每一位
空间复杂度:O(MN),开了这么大的数组存值