Leetcode10. Regular Expression Matching

题目：

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

题目分析：

题目意思是给两个正则表达式，求这两个正则表达式是否能匹配，其中‘.’能匹配任何字符，‘*’能匹配任意个在‘*’之前一位的字符

由于一条字符串完全匹配可以划分成前面的字符串匹配和新增加的字符的匹配问题，因此可以采用动态规划的思路，s[i]、p[j]分别表示前一个和后一个字符串的第i位和第j位，dp[i][j]表示s的前i-1个和j的前j-1个字符串能否完全匹配，能则为true

边界条件有dp[0][0] = true和dp[i][0] = false

转移方程要分条件：

1. if p[j-1] != '*' :

dp[i][j] = dp[i-1][j-1] && (s[i-1] == p[j-1] || p[j-1] == '.' )

2. if p[j] == '*' && 该 '*' match了s中的0个字符

dp[i][j] = dp[i][j-2]

3. if p[j] == '*' && 该 '*' match了s中的1个或多个字符

dp[i][j] = dp[i - 1][j] && (s[i - 1] == p[j - 2] || p[j - 2] == '.')

c++代码：

class Solution {
public:
    bool isMatch(string s, string p) {
        int m = s.length(), n = p.length(); 
        vector<vector<bool> > dp(m + 1, vector<bool> (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 && (s[i - 1] == p[j - 2] || p[j - 2] == '.') && dp[i - 1][j]);
                else dp[i][j] = i > 0 && dp[i - 1][j - 1] && (s[i - 1] == p[j - 1] || p[j - 1] == '.');
        return dp[m][n];
    }
};