Update Manacher算法.md

This commit is contained in:
hao14293
2019-06-29 10:13:02 +08:00
committed by GitHub
parent 9fd2f2bb32
commit d57c9d18e6

View File

@@ -17,10 +17,7 @@
i | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21
:-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-:
s_new[i] | $ | # | a | # | b | # | b | # | a | # | h | # | o | # | p | # | x | # | p | # | o | #
p[i] | | 1 | 2 | 1 | 2 | 5 | 2 | 1 | 2 | 1 | 2 | 1 | 2 | 1 | 2 | 1 | 6 | 1 | 4 | 1 | 2 | 1
![6.png](https://i.loli.net/2019/06/29/5d16c90730ce073372.png)
可以看出, <code> p[i] - 1 </code> 正好是源字符串最长回文串的长度。