解法1:动态规划法
状态:dp[i][j] 表示字符串s在[i,j]区间的子串是否是一个回文串。
class Solution {
public int countSubstrings(String s) {
// 动态规划
boolean[][] dp = new boolean[s.length()][s.length()];
int result = 0;
for (int j = 0; j < s.length(); j++) { //一定要把列放在外层
for (int i = 0; i <= j; i++) {
if (s.charAt(i) == s.charAt(j) && (j - i < 2 || dp[i + 1][j - 1])) {
dp[i][j] = true;
result++;
}
}
}
return result;
}
}
解法2:中心扩散双指针
class Solution {
public int countSubstrings(String s) {
int result = 0;
for (int center = 0; center< 2*s.length()-1; center++) {
int left=center/2;
int right=left+center%2;
while(left>=0&&right<s.length()&&s.charAt(left)==s.charAt(right)){
--left;
++right;
++result;
}
}
return result;
}
}