题干
/*
给定一个字符串 s,找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。
示例 1:
输入: "babad"
输出: "bab"
注意: "aba" 也是一个有效答案。
示例 2:
输入: "cbbd"
输出: "bb"
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-palindromic-substring
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
*/
暴力解法
两层循环选出所有子串并判断其是不是回文,在此基础上选最长即可
class Solution {
public:
string longestPalindrome(string s) {
if (s.empty()) return s;
int i, j;
int length = 0;
string longestSubS = s;
for (i = 0; i < s.length()-1; ++i) {
for (j = 0; j <= s.length()-i; ++j) {
string subS(s, i, j);
if (isPalindrome(subS) && subS.length() > length) {
length = subS.length();
longestSubS = subS;
}
}
}
return longestSubS;
}
bool isPalindrome(string s) {
int i;
for (i = 0; i < s.length() / 2; ++i) {
if (s[s.length() - 1 - i] != s[i])return false;
}
return true;
}
};
动态规划
状态转移方程
摘自 https://blog.csdn.net/ansizhong9191/article/details/88531227
class Solution {
public:
string longestPalindrome(string s) {
if (s.empty())return s;
int n = s.size();
bool dp[1000][1000];
memset(dp, false, sizeof(dp));
int i, j;
int start = 0, max_len = 0;
for (j = 0; j < n; ++j) {
dp[j][j] = true;
for (i = 0; i<=j; ++i) {
if (j == i + 1) {
dp[i][j] = (s[i]==s[j]);
}
else if (j > i + 1) {
dp[i][j] = (s[i] == s[j]) && (dp[i+1][j-1]);
}
if (dp[i][j] == true && ((j - i + 1) > max_len)) {
start = i, max_len = j - i + 1;
}
}
}
return s.substr(start, max_len);
}
};