题目链接:https://leetcode.cn/problems/palindromic-substrings/
题目如下:
class Solution {
public:
int countSubstrings(string s) {
int res=0;
//双指针往两边扩
for(int i=0;i
res++;//单个字母也算回文子串
//回文子串>=2
//回文子串为奇数
int l=i-1,r=i+1;
while(l>=0&&rres++;l--;r++;}
//回文子串为偶数
l=i,r=i+1;
while(l>=0&&rres++;l--;r++;}
}
return res;
}
};



