MIT Introduction to Algorithms 学习笔记(十)

def karp_rabin(T, P):
n = len(T)
m = len(P)
d = 256
q = 101
h = d ** (m - 1) % q

p = 0
t = 0
for i in range(m):
p = (d*p + ord(P[i])) % q
t = (d*t + ord(T[i])) % q

for s in range(n - m + 1):
print(s,p,t)
if p == t and T[s:s+m] == P:
return s
if s < n - m:
t = ( d * ( t - ord( T[s] ) * h ) + ord( T[s + m] ) ) % q