题目:给定一个字符串 s
,找到 s
中最长的回文子串。
示例 1:
输入:s = "babad"
输出:"bab"
解释:"aba" 同样是符合题意的答案。
示例 2:
输入:s = "cbbd"
输出:"bb"
示例 3:
输入:s = "a"
输出:"a"
示例 4:
输入:s = "ac"
输出:"a"
方案一:暴力解法(代码可以运行,但是超时了,时间复杂度O(n^2))
class Solution {
public:
string longestPalindrome(string s) {
if (s.length() < 2) {
return s;
}
string res;
int max_len = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = i; j < s.length(); j++) {
int m = i, n = j;
while(m < n) {
if (s[m] != s[n]) {
break;
}
m++;
n--;
}
if ((m >= n) && (max_len < j - i + 1)) {
max_len = j - i + 1;
res = s.substr(i,max_len);
}
}
}
return res;
}
};
方案二:动态规划
class Solution {
public:
string longestPalindrome(string s) {
int n = s.size();
vector<vector<int>> dp(n, vector<int>(n));
string ans;
for (int l = 0; l < n; ++l) {
for (int i = 0; i + l < n; ++i) {
int j = i + l;
if (l == 0) {
dp[i][j] = 1;
} else if (l == 1) {
dp[i][j] = (s[i] == s[j]);
} else {
dp[i][j] = (s[i] == s[j] && dp[i + 1][j - 1]);
}
if (dp[i][j] && l + 1 > ans.size()) {
ans = s.substr(i, l + 1);
}
}
}
return ans;
}
};