String Manacher the longest palindrome string.

The longest palindrome substring is a substring of a string that reads from left to right and from right to left.

The Manacher algorithm can be used to ask, his complexity is O (n).

Can read this article http://blog.csdn.net/ywhorizen/article/details/6629268

But there should be a mistake (tangled up my day ...) )

This is the sentence, the article is said when Mx-i <= Mp[j] time to use, because the back is not compared.

　　

However, the blue part is equal, if the red is equal to blue, then Mx can not be this value, so the red must not be equal to the blue, so that only when mx-i = = Mp[j] or mx<=i is to be used.

String Manacher the longest palindrome string.