问题描述
Given a string, your task is to count how many palindromic substrings in this string.
The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.
Example 1:
Input: “abc”
Output: 3
Explanation: Three palindromic strings: “a”, “b”, “c”.
Example 2:
Input: “aaa”
Output: 6
Explanation: Six palindromic strings: “a”, “a”, “a”, “aa”, “aa”, “aaa”.
Note:
The input string length won’t exceed 1000.
思路分析
给一个string,计算string中有多少个回文子字符串。
循环字符串的每一个位置,从每一个字符出发,向左向右分别延伸,寻找子字符串。分为奇数情况和偶数情况两种,可以覆盖所有的子字符串。在扩展的过程中,只要没有越界并且满足回文条件,就用全局变量count记录子字符串个数。
代码
class Solution {
public:
int count = 0;
int countSubstrings(string s) {
if (s.length() == 0)
return 0;
for(int i = 0; i < s.length(); i++){
extendPalindrome(s, i, i);
extendPalindrome(s, i, i + 1);
}
return count;
}
void extendPalindrome(string &s, int left, int right){
while(left >= 0 && right < s.length() && s[left] == s[right]){
count++;
left--;
right++;
}
}
};
时间复杂度:
O(n2)
O
(
n
2
)
//最坏情况
空间复杂度:
O(1)
O
(
1
)
反思
注意有奇偶两种情况,所以字串也可能不一样,需要计算两次。