动态规划
public static String longestPalindrome(String s) {
int n=s.length();
boolean[][] dp=new boolean[n][n];
String Sr="";
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]=true;
}else if (l==1){
dp[i][j]=(s.charAt(i)==s.charAt(j));
}else {
dp[i][j]=(s.charAt(i)==s.charAt(j)&&dp[i+1][j-1]);
}
if (dp[i][j]&&l+1>Sr.length()){
Sr=s.substring(i,i+1+l);
}
}
}
return Sr;
}
学以致用
- 动态规划
状态方程: P(i,j)=P(i+1,j−1)∧(S i ==S j )
初始条件和边界情况: p(i,i)=true
&&P(i,i+1)=(S i ==S i+1 )
计算顺序: 由小到大