Manacher算法求字符串最大回文长度

最新推荐文章于 2024-10-14 16:01:29 发布

烟火气QAQ

最新推荐文章于 2024-10-14 16:01:29 发布

阅读量99

点赞数

文章标签：算法 c++

本文链接：https://blog.csdn.net/qq_46897935/article/details/124636594

版权

Manacher算法

#include<iostream>
#include<string>
#include <algorithm>
using namespace std;
char* manacher(string str)
{
	int n = str.length() * 2 + 1;
	char* ch = new char[n];
	int index = 0;
	for (int i = 0; i!=n; i++)
	{
		ch[i] = (i & 1) == 0 ? '#' : str[index++];
	}
	return ch;
}
int maxLcpsLength(string s)
{
	if (s.length() == 0) {
		return 0;
	}
	char* ch = manacher(s);
	int n = s.length() * 2 + 1;
	int* pArr = new int[n];     //回文长度数组
	int C = -1;            //回文中心
	int R = -1;             //回文半径
	int Max = INT_MIN;
	for (int i = 0; i != n; i++) {
		pArr[i] = R > i ? min(pArr[2 * C - i], R - i) : 1;
		while (i + pArr[i]<n && i - pArr[i]>-1) {
			if (ch[i + pArr[i]] == ch[i - pArr[i]]) {
				pArr[i]++;
			}
			else {
				break;
			}
			if (i + pArr[i] > R) {
				R = i + pArr[i];
				C = i;
			}
			Max = max(Max, pArr[i]);
		}
		return Max - 1;
	}
}
int main()
{
	cout << maxLcpsLength("aabbcaabb") << endl;
	system("pause");
	return 0;
}