fixed failure function and cleaned up code in kmp + added rabin-karp

This commit is contained in:
damelLP
2018-01-07 12:49:51 +00:00
parent 495fdc1ff9
commit 0d36dc60c5
2 changed files with 88 additions and 15 deletions

View File

@ -1,4 +1,4 @@
def kmp(pattern, text, len_p=None, len_t=None):
def kmp(pattern, text):
"""
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text
with complexity O(n + m)
@ -14,14 +14,7 @@ def kmp(pattern, text, len_p=None, len_t=None):
"""
# 1) Construct the failure array
failure = [0]
i = 0
for index, char in enumerate(pattern[1:]):
if pattern[i] == char:
i += 1
else:
i = 0
failure.append(i)
failure = get_failure_array(pattern)
# 2) Step through text searching for pattern
i, j = 0, 0 # index into text, pattern
@ -29,20 +22,38 @@ def kmp(pattern, text, len_p=None, len_t=None):
if pattern[j] == text[i]:
if j == (len(pattern) - 1):
return True
i += 1
j += 1
# if this is a prefix in our pattern
# just go back far enough to continue
elif failure[j] > 0:
j = failure[j] - 1
else:
i += 1
elif j > 0:
j = failure[j - 1]
continue
i += 1
return False
if __name__ == '__main__':
def get_failure_array(pattern):
"""
Calculates the new index we should go to if we fail a comparison
:param pattern:
:return:
"""
failure = [0]
i = 0
j = 1
while j < len(pattern):
if pattern[i] == pattern[j]:
i += 1
elif i > 0:
i = failure[i-1]
continue
j += 1
failure.append(i)
return failure
if __name__ == '__main__':
# Test 1)
pattern = "abc1abc12"
text1 = "alskfjaldsabc1abc1abc12k23adsfabcabc"
@ -54,4 +65,16 @@ if __name__ == '__main__':
text = "ABABZABABYABABX"
assert kmp(pattern, text)
# Test 3)
pattern = "AAAB"
text = "ABAAAAAB"
assert kmp(pattern, text)
# Test 4)
pattern = "abcdabcy"
text = "abcxabcdabxabcdabcdabcy"
assert kmp(pattern, text)
# Test 5)
pattern = "aabaabaaa"
assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]