10. 正则表达式匹配

给你一个字符串 s 和一个字符规律 p，请你来实现一个支持 ‘.’ 和 ‘*’ 的正则表达式匹配。

‘.’ 匹配任意单个字符
‘*’ 匹配零个或多个前面的那一个元素

例子：

• s = “aa” p = “a” => false
• s = “aa” p = “a*” => true
• s = “ab” p = “.*” => true

思路：动态规划

动态转移方程（按情况分析）：

不带 * 匹配

• 当s[i-1] == p[j-1]时，有dp[i][j] = dp[i-1][j-1]
• 当p[j-1] == " . "时，也有dp[i][j] = dp[i-1][j-1]

带 * 匹配

第一种情况

• 当s[i] != p[j-1]时，如s = " aab "，p = " aabc* "，有dp[i][j] = dp[i][j-2]

第二种情况

• 当s[i] == p[j-1]时，如s = " aab "，p = " aab* "，有dp[i][j] = dp[i][j-1]
• 当s[i] == p[j-1]时，如s = " aab "，p = " aabb* "，有dp[i][j] = dp[i][j-2]
• 当s[i] == p[j-1]时，如s = " aabb "，p = " aab* "，有dp[i][j] = dp[i-1][j]

第三种情况

• 当p[j-1] = " . "时，如s = " aab "，p = " aab.* "，有dp[i][j] = dp[i][j-2]
• 当p[j-1] = " . "时，如s = " aab "，p = " aa.* "，有dp[i][j] = dp[i][j-1]
• 当p[j-1] = " . "时，如s = " aabb "，p = " aa.* "，有dp[i][j] = dp[i-1][j]

综合第二种和第三种情况，有：
当 s[i] = p[j-1] || p[j-1] =" . "，都有dp[i][j] = dp[i][j-1] || dp[i][j-2] || dp[i-1][j]

初始化

• 如果p中第j个字符不为" * "时，dp[0][j] = false
• 如果p中第j个字符为" * "时，但不是第1个时，dp[0][j] = dp[0][j-2]
• 如果p中第1个字符为" * "时，dp[0][j] = false
• 如果s和p中都为空时，默认是匹配状态，有dp[0][0] = true

代码

public class LeetCode_10_isMatch {
    public static boolean isMatch(String s, String p) {
        if (s == null || p == null) {
            return false;
        }
        int m = s.length();
        int n = p.length();
        boolean[][] dp = new boolean[m + 1][n + 1];
        dp[0][0] = true;
        for (int j = 1; j <= n; j++) {
            if (p.charAt(j - 1) != '*' || j == 1) {
                dp[0][j] = false;
            } else {
                dp[0][j] = dp[0][j - 2];
            }
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (p.charAt(j - 1) != '*') {
                    dp[i][j] = (s.charAt(i - 1) == p.charAt(j - 1) || p.charAt(j - 1) == '.') && dp[i - 1][j - 1];
                } else {
                    if (s.charAt(i - 1) == p.charAt(j - 2) || p.charAt(j - 2) == '.') {
                        dp[i][j] = dp[i][j - 1] || dp[i - 1][j] || dp[i][j - 2];
                    } else {
                        dp[i][j] = dp[i][j - 2];
                    }
                }
            }
        }
        return dp[m][n];
    }
}