最长回文子串 可以将输入字符串进行翻转 然后将翻转后的字符串与输入字符串求最长公共子串就可以
public class leetcode_最长回文子串 {
static String max = "";
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String s1 = scanner.nextLine();
String s2 = new StringBuffer(s1).reverse().toString(); //字符串翻转
System.out.println(LFH(s1, s2));
}
public static String LFH(String s1, String s2){
int[][] arr = new int[s1.length()][s2.length()];
int maxLen = 0;
int maxEnd = 0;
for (int i = 0; i < s1.length(); i++)
for (int j = 0; j < s2.length(); j++) {
if (s1.charAt(i) == s2.charAt(j)) {
if (i == 0 || j == 0) {
arr[i][j] = 1;
} else {
arr[i][j] = arr[i - 1][j - 1] + 1;
}
}
/**********修改的地方*******************/
if (arr[i][j] > maxLen) {
//字符串翻转前的下标
int beforeRev = s1.length() - 1 - j;
//判断翻转前下标+最大长度是否对应现在的下标i
if (beforeRev + arr[i][j] - 1 == i) {
maxLen = arr[i][j];
maxEnd = i;
}
/*************************************/
}
}
return s1.substring(maxEnd - maxLen + 1, maxEnd + 1);
}
}