动态规划
def isMatch1(self, s, p):
"""
:type s: str
:type p: str
:rtype: bool
"""
sn = len(s)
pn = len(p)
dp = [[False] * (pn + 1) for _ in range(sn + 1)]
dp[0][0] = True
for j in range(1, pn + 1):
if p[j - 1] == "*":
dp[0][j] = dp[0][j - 1]
for i in range(1, sn + 1):
for j in range(1, pn + 1):
if (s[i - 1] == p[j - 1] or p[j - 1] == "?"):
dp[i][j] = dp[i - 1][j - 1]
elif p[j - 1] == "*":
# 匹配了多个 匹配了0个
dp[i][j] = dp[i - 1][j] or dp[i][j - 1]
print(dp)
return dp[-1][-1]