1、暴力解法
package leetcode;
class Solution {
public static void main(String[] args) {
Solution solution = new Solution();
String str = "cbbd";
System.out.println(solution.longestPalindrome(str));
}
public String longestPalindrome(String s) {
if (s.length() < 2) {
return s;
}
int begin = 0;
int maxLen = 1;
char[] chars = s.toCharArray();
for (int i = 0; i < s.length() - 1; i++) {
for (int j = i + 1; j < s.length(); j++) {
if (j - i + 1 > maxLen && isPalindrome(chars, i, j)) {
maxLen = j - i + 1;
begin = i;
}
}
}
return s.substring(begin, maxLen + begin);
}
private boolean isPalindrome(char[] chars, int i, int j) {
while (i < j) {
if (chars[i] != chars[j]) {
return false;
}
i++;
j--;
}
return true;
}
}