题目原址
https://leetcode.com/problems/longest-palindromic-substring/description/
AC代码
class Solution {
public String longestPalindrome(String s) {
if(s == null || s.length() <= 1)
return s;
int start = 0 , end = 0;
String ret = new String();;
for(int i = 1; i < s.length(); i++) {
//偶数个判断
start = i - 1;
end = i;
while(start >= 0 && end < s.length() && s.charAt(start) == s.charAt(end)) {
start --;
end ++;
}
int PalinStart = start + 1;
int PalinEnd = end;
if(PalinEnd - PalinStart + 1 > ret.length()) {
ret = s.substring(PalinStart, PalinEnd);
}
//奇数个字符串判断
start = i - 1;
end = i + 1;
while(start >= 0 && end < s.length() && s.charAt(start) == s.charAt(end)) {
start --;
end ++;
}
PalinStart = start + 1;
PalinEnd = end ;
if(PalinEnd - PalinStart + 1 > ret.length()) {
ret = s.substring(PalinStart, PalinEnd);
}
}
return ret;
}
}