#include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution {
public:
string longestPalindrome(string s) {
int n = s.size();
if (n < 2) {
return s;
}
int maxLen = 1;
int begin = 0;
// dp[i][j] 表示 s[i..j] 是否是回文串
vector<vector<int>> dp(n, vector<int>(n));
// 初始化:所有长度为 1 的子串都是回文串
for (int i = 0; i < n; i++) {
dp[i][i] = true;
}
// 递推开始
// 先枚举子串长度
for (int L = 2; L <= n; L++) {
// 枚举左边界,左边界的上限设置可以宽松一些
for (int i = 0; i < n; i++) {
// 由 L 和 i 可以确定右边界,即 j - i + 1 = L 得
int j = L + i - 1;
// 如果右边界越界,就可以退出当前循环
if (j >= n) {
break;
}
if (s[i] != s[j]) {
dp[i][j] = false;
} else {
if (j - i < 3) {
dp[i][j] = true;
} else {
dp[i][j] = dp[i + 1][j - 1];
}
}
// 只要 dp[i][L] == true 成立,就表示子串 s[i..L] 是回文,此时记录回文长度和起始位置
if (dp[i][j] && j - i + 1 > maxLen) {
maxLen = j - i + 1;
begin = i;
}
}
}
return s.substr(begin, maxLen);
}
};
class Solution {
public:
pair<int,int>expandaroudcenter(const string& s,int left,int right){
while(left >= 0 && right <= s.size() &&s[left] == s[right]){
--left;
++right;
}
return {left+1,right-1};
}
string longestPalindrome(string s) {
int begin = 0,end = 0;
for(int i = 0;i < s.size();i++){
auto [left1,right1] = expandaroudcenter(s,i,i);
auto [left2,right2] = expandaroudcenter(s,i,i+1);
if(right1-left1 > end - begin){
begin = left1;
end = right1;
}
if(right2 - left2 > end - begin){
begin = left2;
end = right2;
}
}
return s.substr(begin,end-begin+1);
}
};
暴力解:
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param A string字符串
* @return int整型
*/
int getLongestPalindrome(string A) {
// write code here
int max_len = 0;
for(int i = 0; i < A.size(); i++){//子串首字符
for(int j = 1; j <= A.size() - i; j++){//子串长度
string now = A.substr(i,j);
if(isPalindrome(now) && j > max_len){
max_len = j;
}
}
}
return max_len;
}
bool isPalindrome(string s){
if(s.size() <= 1){
return true;
}
int l = 0;
int r = s.size()-1;
while(l < r){
if(s[l] != s[r]){
return false;
}else{
l++;
r--;
}
}
return true;
}
};
Go:
func longestPalindrome(s string) string {
start,end := 0,0
for i := 0; i < len(s); i++{
left1,right1 := expandAroundCenter(s,i,i)
left2,right2 := expandAroundCenter(s,i,i+1)
if right1-left1 > end - start{
end = right1
start = left1
}
if right2-left2 > end - start{
end = right2
start = left2
}
}
return s[start:end+1]
}
func expandAroundCenter(s string,left,right int)(int,int){
for left >= 0 && right < len(s) &&s[left] == s[right]{
left--
right++
}
return left+1,right-1;
}