package dp;
//5. Longest Palindromic Substring
class Solution {
public String longestPalindrome(String s) {
if (s.length() == 0) {
return "";
}
boolean dp[][] = new boolean[s.length()][s.length()];
int maxLen = 1;
String ans = s.charAt(0) + "";
for (int i = 0; i < s.length(); i++) {
dp[i][i] = true;
}
for (int i = s.length() - 1; i >= 0; i--) {
for (int j = i + 1; j < s.length(); j++) {
if (j - i == 1) {
dp[i][j] = s.charAt(i) == s.charAt(j);
} else {
dp[i][j] = dp[i + 1][j - 1] && s.charAt(i) == s.charAt(j);
}
if (dp[i][j] && j - i + 1 > maxLen) {
ans = s.substring(i, j + 1);
maxLen = j - i + 1;
}
}
}
return ans;
}
public static void main(String[] args) {
System.out.println(new Solution().longestPalindrome(""));
System.out.println(new Solution().longestPalindrome("babad"));
System.out.println(new Solution().longestPalindrome("cbbd"));
System.out.println(new Solution().longestPalindrome("abacab"));
}
}
画图推动态规划方程: