python写算法太慢_作业：在python中实现Z算法，它真的很慢，比简单的字符串搜索慢...

import sys

import time

# z algorithm a.k.a. the fundemental preprocessing algorithm

def z(P, start=1, max_box_size=sys.maxsize):

n = len(P)

boxes = [0] * n

l = -1

r = -1

for k in range(start, n):

if k > r:

i = 0

while k + i < n and P[i] == P[k + i] and i < max_box_size:

i += 1

boxes[k] = i

if i:

l = k

r = k + i - 1

else:

kp = k - l

Z_kp = boxes[kp]

if Z_kp < r - k + 1:

boxes[k] = Z_kp

else:

i = r + 1

while i < n and P[i] == P[i - k] and i - k < max_box_size:

i += 1

boxes[k] = i - k

l = k

r = i - 1

return boxes

# a simple string search

def naive_string_search(P, T):

m = len(T)

n = len(P)

indices = []

for i in range(m - n + 1):

if P == T[i: i + n]:

indices.append(i)

return indices

# string search using the z algorithm.

# The pattern you're searching for is simply prepended to the target text

# and than the z algorithm is run on that concatenation

def z_string_search(P, T):

PT = P + T

n = len(P)

boxes = z(PT, start=n, max_box_size=n)

return list(map(lambda x: x[0]-n, filter(lambda x: x[1] >= n, enumerate(boxes))))