135/300
- 正则表达式匹配
给你一个字符串 s 和一个字符规律 p,请你来实现一个支持 ‘.’ 和 ‘’ 的正则表达式匹配。
‘.’ 匹配任意单个字符
'’ 匹配零个或多个前面的那一个元素
所谓匹配,是要涵盖 整个 字符串 s的,而不是部分字符串。
说明:
s 可能为空,且只包含从 a-z 的小写字母。
p 可能为空,且只包含从 a-z 的小写字母,以及字符 . 和 。
示例 1:
输入:
s = “aa”
p = “a”
输出: false
解释: “a” 无法匹配 “aa” 整个字符串。
示例 2:
输入:
s = “aa”
p = "a"
输出: true
解释: 因为 ‘’ 代表可以匹配零个或多个前面的那一个元素, 在这里前面的元素就是 ‘a’。因此,字符串 “aa” 可被视为 ‘a’ 重复了一次。
示例 3:
输入:
s = “ab”
p = "."
输出: true
解释: "." 表示可匹配零个或多个(’’)任意字符(’.’)。
示例 4:
输入:
s = “aab”
p = “cab”
输出: true
解释: 因为 '’ 表示零个或多个,这里 ‘c’ 为 0 个, ‘a’ 被重复一次。因此可以匹配字符串 “aab”。
示例 5:
输入:
s = “mississippi”
p = "misisp."
输出: false
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/regular-expression-matching
思路:动态规划
dp[i][j]: i → \to →string; j → \to →pattern
1、起始:把empty考虑进去,如下:
b * a c *(pattern)
T F T F F F
a F
当s = “”, p ="", dp[i][j]为True
当s = “”, p = “b*”, dp[i][j]为True(也就是看s = “”, p = "“的状态)
当s = “”, p = “b*ac*”, dp[i][j]为False(也就是看s = “”, p = “b*a"的状态)
总结一下就是 dp[i][j] = dp[i][j-2]
当s = “a”, p =””, dp[i][j]为False
2、相同
当s[i] = p[j], 则dp[i][j] = dp[i-1][j-1]
譬如:
b c (pattern)
T F F
a F F F
c F F False
c一样,我们就直接取a&b的F
3、星号
3.1、异
当p[j] = * , 分两类讨论:为零or一到多个
b * a c *(pattern)
T F T F F F
a F F False
为零:s = “a”, p = “b*”
→
\to
→ s = “a”, p = “”
→
\to
→ dp[i][j] = dp[i][j-2]
→
\to
→False
一到多:s = “a”, p = “b*”, b!=a
→
\to
→ False
3.2、同
a * a c *(pattern)
T F T F F F
a F T True
为零:s = “a”, p = “a*”
→
\to
→ s = “a”, p = “”
→
\to
→ dp[i][j] = dp[i][j-2]
→
\to
→False
一到多:s = “a”, p = “a*”, a=a,
→
\to
→ s = “”, p = “a*”
→
\to
→ True
a a * (pattern)
T F F F
x F F F F
a F F F False
为零:s = “xa”, p = “aa*”
→
\to
→ s = “xa”, p = “a”
→
\to
→False
一到多:s = “xa”, p = “aa*”, a=a,
→
\to
→ s = “x”, p = “aa*”
→
\to
→ dp[i][j] = dp[i-1][j]
→
\to
→ False
b a * (pattern)
T F F F
b F T F T
a F F T True
为零:s = “ba”, p = “ba*”
→
\to
→ s = “ba”, p = “b”
→
\to
→ False
一到多:s = “ba”, p = “ba*”, a=a,
→
\to
→ s = “b”, p = “ba*”
→
\to
→ dp[i][j] = dp[i-1][j]
→
\to
→ True
举例:
s = “aaabc”
p = “a*bc”
class Solution:
def isMatch(self, s: str, p: str) -> bool:
#memo准备:
dp = [[False]*(len(p)+1) for _ in range(len(s)+1)]
#s, p均为空时:
dp[0][0] = True
#当s为空,p中有星号时:(s = '', p = 'a*')
for j in range(1, len(p)):
if p[j] == '*':
dp[0][j+1] = dp[0][j-1]
for i in range(1, len(s)+1):
for j in range(1, len(p)+1):
#相同时,(s = 'ba', p = 'ca', a = a)
if p[j-1] in [s[i-1], '.']:
dp[i][j] = dp[i-1][j-1]
if p[j-1] == '*':
#为零:
dp[i][j] = dp[i][j-2]
#一到多:
if not dp[i][j] and p[j-2] in [s[i-1],'.']:
dp[i][j] = dp[i-1][j]
return dp[-1][-1]