DP-LeetCode10. 正则表达式匹配（零个或多个前面的那个元素）

相似题

LeetCode44. 通配符匹配（任意字符串包括空）https://blog.csdn.net/IOT_victor/article/details/106930707

1、题目描述

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

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

2、代码详解

class Solution:
    def isMatch(self, s, p):
        m = len(s)  # text
        n = len(p)  # pattern
        dp = [[False for i in range(0, n + 1)] for j in range(0, m + 1)]  # m*n
        dp[0][0] = True  # dp[0][0]初始化为true，由此开始转移
        # 特例：处理 m = 0，即s为空串
        for i in range(1, n + 1):
            if p[i - 1] == '*':
                dp[0][i] = dp[0][i - 2]

        for i in range(1, m + 1):
            for j in range(1, n + 1):
                if p[j - 1] == '*':
                    dp[i][j] = dp[i][j - 2]  # 不要 x*, 去掉p串后两个字符
                    if s[i - 1] == p[j - 2] or p[j - 2] == '.':  # '*'不去匹配
                        dp[i][j] |= dp[i - 1][j]
                else:  # p[j - 1] != '*',是正常字符
                    if s[i - 1] == p[j - 1] or p[j - 1] == '.':  # 如果两字符相同或者为.
                        dp[i][j] = dp[i - 1][j - 1]  # 当前状态由前一个转移而来

        return dp[m][n]

S = Solution()
s = 'aab'
p = 'c*a*b'
print(S.isMatch(s, p)) # True