leecode10. Regular Expression Matching字符串匹配

最新推荐文章于 2023-06-23 21:22:57 发布

仝笛

最新推荐文章于 2023-06-23 21:22:57 发布

阅读量177

点赞数

分类专栏：算法 python leecode 文章标签： leecode

本文链接：https://blog.csdn.net/weixin_42764391/article/details/94915315

版权

python 同时被 3 个专栏收录

53 篇文章 0 订阅

订阅专栏

算法

35 篇文章 0 订阅

订阅专栏

leecode

21 篇文章 0 订阅

订阅专栏

leecode10. Regular Expression Matching字符串匹配
‘.’ Matches any single character.
‘*’ Matches zero or more of the preceding element.

Example 1:

Input:
s = “aa”
p = “a”
Output: false
Explanation: “a” does not match the entire string “aa”.
Example 2:

Input:
s = “aa”
p = “a*”
Output: true
Explanation: ‘*’ means zero or more of the preceding element, ‘a’. Therefore, by repeating ‘a’ once, it becomes “aa”.
Example 3:

Input:
s = “ab”
p = “."
Output: true
Explanation: ".” means “zero or more (*) of any character (.)”.
Example 4:

Input:
s = “aab”
p = “cab”
Output: true
Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore, it matches “aab”.
Example 5:

Input:
s = “mississippi”
p = “misisp*.”
Output: false

class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        
        dp = [[False] * (len(s) + 1) for _ in range(len(p) + 1)]
        dp[0][0] = True
        #初始化第一列
        for i in range(1, len(p)):
            dp[i + 1][0] = dp[i - 1][0] and p[i] == '*'
        #i行
        for i in range(len(p)):
        	#j列
            for j in range(len(s)):
            	#模板[i]=*
                if p[i] == '*':
                	#p[1~i]s[1~j] 结果=  p[1~i-2]s[1~j] or p[1~i-1]s[1~j]
                    dp[i + 1][j + 1] = dp[i - 1][j + 1] or dp[i][j + 1]
                    #模板[i]=* 且 模板[i-1]=s[j]或模板[i-1]=.
                    if p[i - 1] == s[j] or p[i - 1] == '.':
                    	#p[1~i]s[1~j] 结果=  flase or p[1~i]s[1~j-1]
                        dp[i + 1][j + 1] |= dp[i + 1][j]
                else:
                    dp[i + 1][j + 1] = dp[i][j] and (p[i] == s[j] or p[i] == '.')
        return dp[-1][-1]