647. 回文子串
class Solution {
public int countSubstrings(String s) {
char[] str = s.toCharArray();
boolean[][] dp = new boolean[str.length][str.length];
int count =0;
for(int i = str.length -1; i>=0;i--){
for(int j = i; j<=str.length-1;j++){
if(str[i] == str[j]){
if(j-i<=1){
dp[i][j] = true;
count++;
}else{
if(dp[i+1][j-1] == true){
dp[i][j] = true;
count++;
}
}
}
}
}
return count;
}
}
516.最长回文子序列
dp[i][j]:从第i个元素到第j个元素的最长回文子序列
递推公式:如果第i个元素和第j个元素相等,则在dp[i][j] = dp[i+1][j-1]+2
如果不相等,dp[i][j] = max(dp[i+1][j],dp[i][j-1])
初始化:dp[i][i] = 1
遍历顺序:从下到上,从左到右
class Solution {
public int longestPalindromeSubseq(String s) {
char[] str = s.toCharArray();
int[][] dp = new int[str.length][str.length];
for(int i = 0; i<str.length;i++){
dp[i][i] = 1;
}
for(int i = str.length - 1; i>=0; i--){
for(int j = i+1; j<=str.length-1; j++){
if(str[i] == str[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][str.length-1];
}
}