字符串中最大回文子串——C++实现

C++代码：
方法一：

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
using namespace std;

char* LongestPalindromicSubstring(char *str,int n) {
	if (str == NULL||n==1) {
		return str;
	}

	char *substr;
	substr = (char*)malloc(n + 1);
	int start = 0;//回文字符串起始位置
	int max = 1;//回文字符串个数
	
	//初始化一个二维数组
	vector<vector<char>>  dp(n+1, vector<char>(n+1));
	for (int i = 0; i < n; i++) {
		dp[i][i] = 1;//单个字符是回文串
		if (i<n - 1 && str[i] == str[i + 1])//连续两个相同字符是回文串
		{
			dp[i][i + 1] = 1;
			max = 2;
			start = i;
		}
	}

	for (int l = 3; l <= n; l++)//l表示检索的子串长度，等于3表示先检索长度为3的子串
	{
		for (int i = 0; i + l - 1<n; i++)
		{
			int j = l + i - 1;//终止字符位置
			if (str[i] == str[j] && dp[i + 1][j - 1] == 1)//状态转移
			{
				dp[i][j] = 1;
				start = i;
				max = l;
			}
		}
	}
	strncpy(substr, &str[start], max);
	substr[max]='\0';
	return substr;

	if (substr != NULL) {
		free(substr);
		substr=NULL;
	}
}

int main() {
	char str[50];
	cout << "Please input string:";
	cin >> str;

	int length = strlen(str);
	cout << "The longest palindromic substring:";
	cout << LongestPalindromicSubstring(str, length) << endl;

	return 0;
}

方法二：

#include<iostream>
#include<string>
using namespace std;

string longestPalindrome(string s) {
	// write code here
	if (s.empty()) {
		return "";
	}
	if (s.size() == 1) {
		return s;
	}

	int start = 0, len = 1;
	for (int i = 0; i<s.size();) {
		if (s.size() - i <= len / 2)
			break;
		int j = i, k = i;
		while (k<s.size() - 1 && s[k] == s[k + 1]) {
			k++;
		}
		i = k + 1;
		while (j>0 && k<s.size() - 1 && s[j - 1] == s[k + 1]) {
			j--;
			k++;
		}
		int newlen = k - j + 1;
		if (newlen>len) {
			len = newlen;
			start = j;
		}
	}

	return s.substr(start, len);
}


int main() {
	string str,substr;
	int num;
	int a = 3, b = 5, c = 10;
	int res = (a + b + c >= 10);
	cout << res;
	cout << "Please input the string:";
	cin >> str;

	substr = longestPalindrome(str);
	cout << "The length of longest substring of the string:" << substr << endl;

	return 0;
}

C++运行结果：

编程小提示：方法一中代码第42行必须要有，否则，由于substr申请空间较多，输出的结果中会有乱码。