版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82951456
https://leetcode.com/problems/palindromic-substrings/description/
class Solution {
public:
int countSubstrings(string s) {
int count = 0;
for(int i=1; i<=s.size(); i++){
for(int j=0; j<=s.size()-i; j++){
string temp = s.substr(j, i);
string re_temp = temp;
reverse(re_temp.begin(), re_temp.end());
if(temp == re_temp) count+=1;
}
}
return count;
}
};