算法第12周Regular Expression Matching[hard]

Description

Implement regular expression matching with support for '.' and '*'.

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire input string (not partial).

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true

---

Analysis

这道题目是正则表达式的匹配 符号.代表可以匹配任何字符，字符‘*’代表前面的字符可以出现0次或任意次。
m为带匹配字符串s的长度，n为模板p的长度。
我们初始化一个布尔数组全为false
dp[i][j] 代表s的前i个字符与p的前j个字符是否匹配。
显然，dp[0][0] = true;
接下来我们考虑dp[i][j]:

如果p[j-1] == '*'
   出现0次： dp[i][j] = dp[i][j-2];
   大于0次： dp[i][j] = i > 0&& (s[i-1] == p[j-2]||p[j-2] == '.');
如果p[j-1] != '*'
   p[j-1] == '.': dp[i][j] = i > 0 &&dp[i-1][j-1];
   p[j-1] != '.': dp[i][j] = i > 0 &&dp[i-1][j-1]&&s[i-1] == p[j-1];

---

Solution

class Solution {
public:
    bool isMatch(string s, string p) {
        int m = s.length(); 
        int n = p.length();
        bool dp[m+1][n+1] = {false};
        dp[0][0] = true;
        for (int i = 0; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (p[j-1] == '*') {
                    dp[i][j] = dp[i][j-2]||(i > 0&&dp[i-1][j]&&(s[i-1] == p[j-2]|| p[j-2] == '.'));
                } else  {
                    dp[i][j] = i > 0&&dp[i-1][j-1]&&(s[i-1] == p[j-1]|| p[j-1] == '.');
                }
            }
        }
        for (int i = 0; i < m+1; i++) {
            for (int j = 0; j < n+1; j++) {
                cout << dp[i][j] << " ";
            }
            cout << endl;
        }
        return dp[m][n];
    }
};