mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-02-25 10:28:39 +00:00
Compare commits
5 Commits
b87b9a819f
...
475b5b5184
Author | SHA1 | Date | |
---|---|---|---|
|
475b5b5184 | ||
|
8c5aef0497 | ||
|
4456366da0 | ||
|
7271e3d2a5 | ||
|
c2bd6bf9a2 |
@ -30,17 +30,11 @@ def recursive_match(text: str, pattern: str) -> bool:
|
||||
>>> recursive_match('aa', '.*')
|
||||
True
|
||||
"""
|
||||
if not text and not pattern:
|
||||
return True
|
||||
if not pattern:
|
||||
return not text
|
||||
|
||||
if text and not pattern:
|
||||
return False
|
||||
|
||||
if not text and pattern and pattern[-1] != "*":
|
||||
return False
|
||||
|
||||
if not text and pattern and pattern[-1] == "*":
|
||||
return recursive_match(text, pattern[:-2])
|
||||
if not text:
|
||||
return pattern[-1] == "*" and recursive_match(text, pattern[:-2])
|
||||
|
||||
if text[-1] == pattern[-1] or pattern[-1] == ".":
|
||||
return recursive_match(text[:-1], pattern[:-1])
|
||||
@ -80,19 +74,16 @@ def dp_match(text: str, pattern: str) -> bool:
|
||||
dp = [[False for _ in range(n + 1)] for _ in range(m + 1)]
|
||||
dp[0][0] = True
|
||||
|
||||
for i in range(1, m + 1):
|
||||
dp[i][0] = False
|
||||
|
||||
for j in range(1, n + 1):
|
||||
dp[0][j] = pattern[j - 1] == "*" and dp[0][j - 2]
|
||||
|
||||
for i in range(1, m + 1):
|
||||
for j in range(1, n + 1):
|
||||
if pattern[j - 1] == "." or pattern[j - 1] == text[i - 1]:
|
||||
if pattern[j - 1] in {".", text[i - 1]}:
|
||||
dp[i][j] = dp[i - 1][j - 1]
|
||||
elif pattern[j - 1] == "*":
|
||||
dp[i][j] = dp[i][j - 2]
|
||||
if pattern[j - 2] == "." or pattern[j - 2] == text[i - 1]:
|
||||
if pattern[j - 2] in {".", text[i - 1]}:
|
||||
dp[i][j] |= dp[i - 1][j]
|
||||
else:
|
||||
dp[i][j] = False
|
||||
|
Loading…
x
Reference in New Issue
Block a user