方法一:动态规划
class Solution {
public:
int countSubstrings(string s) {
int res=0;
bool dp[s.size()][s.size()]={false};
for(int j=0;j<s.size();j++){
for(int i=j;i>=0;i--){
if(s[i]==s[j] && ((j-i < 2) || dp[i+1][j-1])){
dp[i][j]=true;
res++;
}
}
}
return res;
}
};
方法二:中心扩散
class Solution {
public:
int countSubstrings(string s) {
int n=s.size(),res=0;
for(int center=0;center<=2*n-1;center++){
int left=center/2;
int right=left+center%2;
while(left>=0 && right<n && s[left]==s[right]){
res++;
left--;
right++;
}
}
return res;
}
};