最长回文子串
public static String longestSubStringHuiWen(char[] stringarray, String s) {
if (stringarray==null || stringarray.length == 0) {
return "";
}
boolean[][] dp = new boolean[stringarray.length][stringarray.length];
int len = stringarray.length;
String string = null;
int maxlen = Integer.MIN_VALUE;
for(int i=len-1; i>=0; i--){
for(int j=i;j<len;j++){
dp[i][j] = (stringarray[i] == stringarray[j]) && ((j-i < 3 || dp[i+1][j-1] == true));
if (dp[i][j]==true && j-i+1>maxlen) {
string = s.substring(i, j+1);
maxlen = string.length();
}
}
}
return string;
}