题目链接:https://leetcode.com/problems/palindromic-substrings/description/
解题思路:枚举所有的状态,判断是否为回文字符串,输出结果。
class Solution {
public:
int countSubstrings(string s) {
int output = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size()-i; j++) {
int isPal = 1;
for (int k = j; k < j+(i+1)/2; k++) {
if (s[k] != s[2*j+i-k]) {
isPal = 0;
break;
}
}
if (isPal) output++;
}
}
return output;
}
};