字符串中的最长回文串--manacher

class Solution {
public:
	string changeString(string s) {     //aba → #a#b#a#
		char* arr = new char[2 * s.length() + 2];  //在leetcode编译器上必须是2*length+2，留个位置给结束符"\0"如果是2*length+1会报错，在VS上则不会
		int index = 0;
		for (int i = 0; i < 2 * s.length() + 1; i++)
		{
			if (i % 2 == 0)
				arr[i] = '#';
			else
				arr[i] = s[index++];
		}
		arr[2 * s.length() + 1] = '\0';
		return arr;
	}
	string longestPalindrome(string s) {
		string s1 = changeString(s);
		int radius = 0;
		int center = -1;
		int C = -1;
		int R = -1;
		int* redius = new int[2 * s.length() + 1];
		for (int i = 0; i < s1.length(); i++)
		{
			redius[i] = R > i ? min(R - i + 1, redius[2 * C - i]) : 1;
			while (-1 < i - redius[i] && i + redius[i] < 2 * s.length() + 1)
			{
				if (s1[i - redius[i]] == s1[i + redius[i]])
					redius[i]++;
				else
					break;
			}

			if (radius < redius[i])
			{
				center = i;
				radius = redius[i];
			}

			if (R < i + redius[i] - 1)
			{
				C = i;
				R = i + redius[i] - 1;
			}
		}

		char* res = new char[2*radius];//在leetcode编译器上必须是2*length+2，留个位置给结束符"\0"如果是2*length+1会报错，在VS上则不会
		int index = 0;
		for (int j = center - radius + 1; j <= center + radius - 1; j++) {
			if (j % 2 == 1)
				res[index++] = s1[j];
		}
		res[index] = '\0';
		return res;

	}
};