c++ leetcode 使用动态规划，循环，马拉车算法 三种方法 求解最长回文子串

 

 

// 马拉车算法
string Manacher(string & query)
{
	string ss = "^#";
	for (auto s : query)
		ss =  ss + s + '#';
	ss += '$';
	vector<int> p(ss.length(), 0);
	int center = 0;
	int mx = 0;
	string max_str = "";
	cout << ss << endl;
	for (int i = 1; i < ss.length(); i++)
	{
		if (i < mx)
		{
			int j = 2 * center - i;
			p[i] = min(mx - i, p[j]);
		}
		while (ss[i - p[i] - 1] == ss[i + p[i] + 1])
			p[i] += 1;
		if (i + p[i] > mx)
		{
			mx = i + p[i];
			center = i;
		}
		if (1 + 2 * p[i] > max_str.length())
			max_str = ss.substr(i - p[i], 2 * p[i]+1);
	}
	return max_str;

}

2、动态规划

string longestPalindrome(string & query)// 动态规划最长回文子串
{
	int n = query.length();
	string ans = "";
	vector<vector<int>> dp(n, vector<int>(n, 0));
	for (int i = 0; i < n; i++)
	{
		dp[i][i] = 1;
		if (i < n - 1)
		{
			if (query[i] == query[i + 1])
			{
				dp[i][i + 1] = 1;
				ans = query.substr(i,2);
			}
		}
	}
		
	for (int L = 3; L <= n; L++) {
		for (int i = 0; i+L-1 < n; i++)
		{
			int j = i + L - 1;
			if (query[i] == query[j] and dp[i+1][j-1] == 1)
			{
				dp[i][j] = 1;
				ans = query.substr(i, L);
			}
		}
	}
	return ans;
		
}

3、使用循环

string Palindrome1(string&query, int i, int j)
{
	while (i >= 0 and j < query.length())
	{
		if (query[i] == query[j])
		{
			i--; j++;
		}
		else
			break;
	}
	return query.substr(i+1, j-i-1);
}
string longestPalindrome1(string & query)// 循环最长回文子串
{
	int n = query.length();
	string ans = "";
	
	for (int i = 0; i < n-1; i++)
	{
		string tmp_i = Palindrome1(query, i, i);
		string tmp_i_i1 = Palindrome1(query, i, i + 1);
		ans = tmp_i.length() > ans.length() ? tmp_i: ans;
		ans = tmp_i_i1.length() > ans.length() ? tmp_i : ans;
	}

	
	return ans;

}