647. Palindromic Substrings

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.

Hint:
这个问题要我们找一个字符串里的所有回文子串的个数，要求是子串，即是连续的。此问题表示，只要是不是同个起点或终点的回文子串我们都视作不同的。
这个问题我们可以自然的想到，对于每个字符，我们把它当中心发散出去找它两边都相同的即是回文子串，且在发散过程中我们就能按长度从小到大的把以该点为中心的所有回文子串找到。
注意到回文子串可以是偶数长度或者奇数长度，如果是偶数长度，那么其中心是两个相同字符；如果是奇数长度，其中心是单个字符。
时间复杂度O(n^2)

class Solution {
public:
    int countSubstrings(string s) {
        int count = 0;
        int n = s.length();
        for (int i = 0; i < n; i++) {
            count += findPalindromic(s, i, i);//odd
            count += findPalindromic(s, i, i+1);//even
        }
        return count;
    }
    int findPalindromic(string s, int l, int r) {
        int n = s.length();
        int count = 0;
        while (l >= 0 && r < n && s[l] == s[r]) {
            count++;
            l--;
            r++;
        }
        return count;
    }
};