class Solution {
public static String longestPalindrome(String s) {
String max_s = "";
for (int i = 0; i < s.length(); i++) {
int num = 1;
while ((i - num) >= 0 && (i + num) < s.length() && s.charAt(i - num) == s.charAt(i + num)) num++;
String t = s.substring(i - num + 1, i + num);
max_s = t.length() > max_s.length() ? t : max_s;
}
for (int i = 0; i < s.length() - 1; i++) {
int i1 = i + 1;
int num = 0;
while ((i - num) >= 0 && (i1 + num) < s.length() && s.charAt(i - num) == s.charAt(i1 + num)) num++;
String t = s.substring(i - num + 1, i1 + num);
max_s = t.length() > max_s.length() ? t : max_s;
}
return max_s;
}
}
最长回文子串
最新推荐文章于 2024-03-25 11:17:41 发布