最长回文子串
中心扩散法
class Solution {
public String longestPalindrome(String s) {
String res = "";
for (int i=0; i<s.length(); i++){
//奇数,向两边扩散
String s1 = palindrome(s, i, i);
//偶数向两边扩散
String s2 = palindrome(s, i, i+1);
res = res.length() > s1.length() ? res : s1;
res = res.length() > s2.length() ? res : s2;
}
return res;
}
public String palindrome(String s, int l, int r){
while(l >=0 && r < s.length() && s.charAt(l) == s.charAt(r)){
l--;
r++;
}
return s.substring(l+1, r);
}
}