JZ52 正则表达式匹配
my version
错误记录
- “aaa”,“a*a” 未通过
- “” , “.*” 未通过
- “”,"." 未通过
- “a”,".*" 未通过
- “ab”,".*" 未通过
class Solution:
def match(self , string , pattern ):
p_string = 0
p_pattern = 0
while p_string < len(string):
if p_pattern >= len(pattern):
# pattern已走完,但还有str
return False
else:
if str[p_string] == pattern[p_pattern] or pattern[p_pattern]=='.':
p_string += 1
p_pattern += 1
elif pattern[p_pattern] == '*':
pre_str = str[p_string]
pre_pattern = pattern[p_pattern]
if pre_pattern != '.':
if p_pattern+1 < len(pattern) and pattern[p_pattern] != pre_str:
# str的指针移到不为等于pre_str的地方
while p_string < len(string) and string[p_string] == pre_str:
p_string += 1
else:
# str和pattern都找到不为pre_str的位置,并计算重复的数
len_str = 0
len_pattern = 0
while p_string < len(string) and string[p_string] == pre_str:
p_string += 1
len_str += 1
if p_pattern+1 < len(pattern):
p_pattern += 1
while p_pattern < len(pattern) and pattern[p_pattern] == pre_str:
p_pattern += 1
len_pattern += 1
if len_pattern > len_str:
# 如果pattern比str长说明不匹配
return False
else:
pass
# 我不会做了
if p_pattern < len(pattern) and pattern[p_pattern] == '*':
p_pattern += 1
while p_pattern+1 < len(pattern) and pattern[p_pattern+1]=='*':
# 判断pattern后面是否存在'.*' 'a*'等可以匹配为空的情况
p_pattern += 2
if p_string == len(string) and p_pattern == len(pattern):
return True
else:
return False
自己做不出来 不做了! QAQ 解决不了’’.*’'的问题
book method1
class Solution:
def eq(self, char_str, char_pat):
if char_str == char_pat or char_pat == '.':
return True
return False
def dp(self, string, pattern, str_idx, pat_idx):
if self.found:
# 正确 剪枝
return
if str_idx == len(string) and pat_idx == len(pattern):
self.found = True
return
if str_idx == len(string) or pat_idx == len(pattern):
return
if self.eq(string[str_idx], pattern[pat_idx][0]):
if pattern[pat_idx][1]:
# 为'.*'或'a*'模板
self.dp(string, pattern, str_idx + 1, pat_idx) # 继续使用模板
self.dp(string, pattern, str_idx + 1, pat_idx + 1) # 往后走
self.dp(string, pattern, str_idx, pat_idx + 1) # 未使用模板
else:
self.dp(string, pattern, str_idx + 1, pat_idx + 1) # 往后走
else:
if pattern[pat_idx][1]: # 这个是模板字符被使用0次的特殊情况
self.dp(string, pattern, str_idx, pat_idx + 1)
return
def match(self , string , pattern ):
string += '#'
pattern += '#' # 这个是防止空串的特殊措施
self.found = False;
string = list(string)
pattern2 = [] # 首先将有*的和其前一个字符绑定为一个模板
for char in list(pattern):
if char != '*':
pattern2.append([char, False])
else:
# 表示该字符是标星的,则其上一个字符标记为True
pattern2[-1][1] = True
self.dp(string, pattern2, 0, 0)
return self.found