回文串算法:
manacher:将每个字符首位加“#”,字符串首加“$”,返回的结果为一个数组,数组的偶数为对应元素所在的回文串长度、
b = "abcdebeabbaf"
c = "".join(["$#"] + [ i +"#" for i in b])
def Manacher(a):
size = len(a)
p = np.array([0]*size)
ind = 0
xm = 1
p[0] = 1
for i in range(1, size):
if xm > i:
p[i] = min(p[2*ind-i], xm-i)
else:
p[i] = 1
while i + p[i] < size and a[i+p[i]] == a[i-p[i]]:
p[i] = p[i] + 1
if xm < i + p[i]:
xm = i + p[i]
ind = i
p = p[1:-1] -1
return p
answer = max(Manacher(c))