转载自:
点击打开链接
/**
*
* author 刘毅(Limer)
* date 2017-02-25
* mode C++
*/
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
char s[1000];
char s_new[2000];
int p[2000];
int Init()
{
int len = strlen(s);
s_new[0] = '$';
s_new[1] = '#';
int j = 2;
for (int i = 0; i < len; i++)
{
s_new[j++] = s[i];
s_new[j++] = '#';
}
s_new[j] = '\0'; //别忘了哦
return j; //返回s_new的长度
}
int Manacher()
{
int len = Init(); //取得新字符串长度并完成向s_new的转换
int maxLen = -1; //最长回文长度
int id;
int mx = 0;
for (int i = 1; i < len; i++)
{
if (i < mx)
p[i] = min(p[2 * id - i], mx - i);
else
p[i] = 1;
while (s_new[i - p[i]] == s_new[i + p[i]])
p[i]++;
if (mx < i + p[i])
{
id = i;
mx = i + p[i];
}
maxLen = max(maxLen, p[i] - 1);
}
return maxLen;
}
int main()
{
while (printf("请输入字符串:\n"))
{
scanf("%s", s);
printf("最长回文长度为 %d\n\n", Manacher());
}
return 0;
}