今天实现以下经典的字符串匹配算法-KMP算法,大概意思是给你一个长的字符串(母串),在给你一个子串,求出子串是否在母串中,如果在,返回在母串下标,不在,按题目要求返回即可。
例如:
母串:abcdfg
子串:abc
则返回:0
具体原理比较复杂,大家可以去哔哩哔哩找视频看,我是看懂了一遍后,直接把代码记住。
KMP算法特别高效,普通的暴力方法会超时。
Python版本的代码:
# TODO kmp算法是解决字符串匹配的,很高效,O(m + n)
def build_next(subs):
next = [0]
now_len, i = 0, 1
while i < len(subs):
if subs[i] == subs[now_len]:
i += 1
now_len += 1
next.append(now_len)
else:
if now_len == 0:
next.append(0)
i += 1
else:
now_len = next[now_len - 1]
return next
def kmp(s, subs):
next = build_next(subs=subs)
i, j = 0, 0
while i < len(s):
if s[i] == subs[j]:
i += 1
j += 1
elif j > 0:
j = next[j - 1]
else:
i += 1
if j == len(subs):
return i - j
return -1
s = input()
subs = input()
print('子串地址为:{}'.format(kmp(s, subs=subs)))