上原题:
Given a string s
, return the number of palindromic substrings in it.
A string is a palindrome when it reads the same backward as forward.
A substring is a contiguous sequence of characters within the string.
Example 1:
Input: s = "abc" Output: 3 Explanation: Three palindromic strings: "a", "b", "c".
Example 2:
Input: s = "aaa" Output: 6 Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
Constraints:
1 <= s.length <= 1000
s
consists of lowercase English letters.
分析:
关于回文字符串 ,大概3种形式,
a. 单个字符
b. aa, 偶数个对称
c. aba, 奇数个对称
因此,实现方案为,针对每一个字符,a. 本身算一个,b. 如果a[i] = a[i + 1]算一个,然后依次延申,a[i - 1] == a[i + 1 + 1], a[i - 2] == a[i + 1 + 2]; c. 以该字符为中心,分别向两个方向检查,符合的结果+1.
附上代码:
class Solution {
public:
int countSubstrings(string s) {
int num = 0;
for(auto i = 0; i < s.size(); i++)
{
num++;
for(int j = 1; j <= i; j++)
{
if( i - j >= 0 and i + j < s.size() and s[i - j] == s[i + j])
num++;
else
break;
}
if( i + 1 < s.size() and s[i] == s[i+1])
{
num++;
for(int j = 1; j <= i; j++)
{
if(i - j >= 0 and i + 1 + j <= s.size() and s[i - j] == s[i + 1 + j])
num++;
else
break;
}
}
}
return num;
}
};