一道hard题,解析看官解,感觉边界问题很恶心,发一下能看懂的代码
class Solution {
public:
bool isMatch(string s, string p) {
int n = s.size(), m = p.size();
// dp[i][j] s[i-1]与p[j-1]的字符串段是否匹配
vector<vector<bool>> dp(n + 1, vector<int>(m + 1));
dp[0][0] = true; // 表示空字符串(n=0)时一定匹配,dp[0][j>0]不一定匹配,因此i从0开始(p=".*"就可能匹配)
for (int i = 0; i <= n; ++i) {
for (int j = 1; j <= m; ++j)
{
if (p[j - 1] != '*') {
if (i >= 1 && (s[i - 1] == p[j - 1] || p[j - 1] == '.')) {
dp[i][j] = dp[i - 1][j - 1];
}
}
else {
if (j >= 2) {
dp[i][j] |= dp[i][j - 2];
}
if (i >= 1 && j >= 2 &&(s[i - 1] == p[j - 2] || p[j - 2] == '.')) {
dp[i][j] |= dp[i - 1][j];
}
}
cout << "dp[" << i << "][" << j << "] = " << dp[i][j] << endl;
}
}
return dp[n][m];
}
};