Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
一般最长回文子串的理解为,正读和反读是一样的,换一种理解方式就是关于中间对称的,第二种理解更容易对算法产生理解
class Solution {
public String longestPalindrome(String s) {
if (s == null || s.length() < 1) return "";
int start = 0, end = 0;
for (int i = 0; i < s.length(); i++) {
//以该字母i为对称中心
int len1 = expandAroundCenter(s, i, i);
//以该字母与相邻后面一个字母为对称中心
int len2 = expandAroundCenter(s, i, i + 1);
int len = Math.max(len1, len2);
//更新end,start
if (len > end - start) {
start = i - (len - 1) / 2;
end = i + len / 2;
}
}
return s.substring(start, end + 1);
}
//以该字母为中心,向两边扩散,若相等时则为回文串,直到找到以该字母为中心的最大一个
private int expandAroundCenter(String s, int left, int right) {
int L = left, R = right;
while (L >= 0 && R < s.length() && s.charAt(L) == s.charAt(R)) {
L--;
R++;
}
return R - L - 1;
}
}