mirror of
https://github.com/hao14293/2021-Postgraduate-408.git
synced 2026-02-03 02:23:40 +08:00
Update Manacher算法.md
This commit is contained in:
@@ -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
|
||||

|
||||
|
||||
|
||||
可以看出, <code> p[i] - 1 </code> 正好是源字符串最长回文串的长度。
|
||||
|
||||
Reference in New Issue
Block a user