动归解法:
class Solution {
public String longestPalindrome(String s) {
int n=s.length();
if(n<2) return s;
int start=-1;
int maxLength=-1;
char[] ch=s.toCharArray();
boolean[][] dp=new boolean[n][n];
for(int i=0;i<n;i++){
dp[i][i]=true;
}
for(int j=1;j<n;j++){
for(int i=0;i<=j;i++){
if(ch[i]!=ch[j]){
dp[i][j]=false;
}else{
if(j-i<3){
dp[i][j]=true;
}else{
dp[i][j]=dp[i+1][j-1];
}
}
if(dp[i][j] && j-i+1>maxLength){
start=i;
maxLength=j-i+1;
}
}
}
return s.substring(start,start+maxLength);
}
}