代码随想录算法训练营天 第九章 五十七天| 647. 回文子串 516.最长回文子序列
647. 回文子串
class Solution {
public int countSubstrings(String s) {
boolean[][] dp = new boolean[s.length()][s.length()];
int result = 0;
for (int i = s.length()-1; i>=0; i--) {
for (int j = i; j <= s.length()-1; j++) {
if (s.charAt(i) == s.charAt(j)) {
if (j-i <= 1) {
result++;
dp[i][j] = true;
} else if (dp[i+1][j-1]) {
result++;
dp[i][j] = true;
}
}
}
}
return result;
}
}
516.最长回文子序列
class Solution {
public int longestPalindromeSubseq(String s) {
int[][] dp = new int[s.length()+1][s.length()+1];
for (int i = s.length()-1; i >= 0; i--) {
dp[i][i] = 1;
for (int j = i+1; j < s.length(); j++) {
if (s.charAt(i) == s.charAt(j)) {
dp[i][j] = dp[i+1][j-1] + 2;
} else {
dp[i][j] = Math.max(dp[i+1][j], dp[i][j-1]);
}
}
}
return dp[0][s.length()-1];
}
}