题目描述:求最长的回文子字符串
难度:medium
Example 1:
Input: “babad”
Output: “bab”
Note: “aba” is also a valid answer.
Example 2:
Input: “cbbd”
Output: “bb”
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++) {
//得到最大回文长度
int len1 = expandAroundCenter(s, i, i);
int len2 = expandAroundCenter(s, i, i + 1);
int len = Math.max(len1, len2);
//更新substring的首末位置
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;
}