字符串匹配dp

https://leetcode-cn.com/problems/regular-expression-matching/submissions/

class Solution {
public:
    bool isMatch(string s, string p) {
        int len_s = s.size();
        int len_p = p.size();
        vector<vector<bool>> dp(len_s+1);
        for (auto&it:dp)
            it.resize(len_p+1);
        dp[0][0] = true;
        for (int j = 0; j < p.size(); j++)
            dp[0][j+1] = j>0 && p[j]=='*' && dp[0][j-1];
        for (int i = 0; i < s.size(); i++) {
            for (int j = 0; j < p.size(); j++) {
                if (p[j]!='*' && p[j] != '.') {
                    dp[i+1][j+1] = dp[i][j] && (s[i]==p[j]);
                } else if (p[j]=='.'){
                    dp[i+1][j+1] = dp[i][j];
                } else {
                    if (j>0 && p[j-1] == '.') {
                        dp[i+1][j+1] = dp[i+1][j-1] || dp[i][j] || dp[i+1][j] || dp[i][j+1];
                    } else {
                        dp[i+1][j+1] = dp[i+1][j-1] || (dp[i][j] && i>0 && s[i]==s[i-1]) || dp[i+1][j];
                    }
                }
            }
        }
        return dp[len_s][len_p];
    }
};