一、 brute force
暴力遍历算法
class Solution {
public static String longestPalindrome(String s) {
int N = s.length();
int p = 0, q =0;
int length = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1;j < N; j++) {
int half = (j - i)/2 ;
int m;
for (m = 0; m < half + 1; m++) {
if (s.charAt(i + m) != s.charAt(j - m)) {
break;
}
}
if (m == half + 1) {
length = Math.max(length, j - i);
if (length == j - i) {
p = i;
q = j;
}
}
}
}
return s.substring(p, q + 1);
}
}
二、 动态规划
如果是回文字符串,其子字符串也是回文字符串。
假设回文字符串存在,在假设成立的条件下,找到使该字符串存在的子字符串。
class Solution {
public static String longestPalindrome(String s) {
int n = s.length();
boolean[][] substring = new boolean[n][n];
int length = 0, p = 0, q = 0;
for (int i = n; i >= 0; i--) {
for (int j = i; j < n; j++) {
substring[i][j] = s.charAt(i) == s.charAt(j) && (j - i < 2 || substring[i + 1][j - 1]);
if (substring[i][j] && j - i + 1 > length) {
length = j - i + 1;
p = i;
q = j;
}
}
}
return s.substring(p, q + 1);
}
}