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.

题意：如题。
解法一：遍历s的每一个字符时，将每一个字符当作中心，找出所有以他为中心的回文串。

class Solution {
public:
    int countSubstrings(string s) {
        if(s.empty()) return 0;
        int n = s.size(), ans = 0;
        for(int i = 0; i < n; ++i){
            cal(s, i, i, ans);//回文串长度是奇数
            cal(s, i, i + 1, ans);//回文串长度是偶数
        }
        return ans;
    }
    void cal(string s, int i, int j, int &ans){
        while(i >= 0 && j < s.size() && s[i] == s[j]){
            --i; ++j; ++ans;
        }
    }
};

解法二：dp[i][j] 表示 i~j 是否为回文，注意应从后向前遍历如s = 12345, 依次判断
5, 4, 45, 3, 34, 345…
若从前向后1, 12, 123, 1234, 12345, 2, 23… 在判断时会找不到中间结果。

class Solution {
public:
    int countSubstrings(string s) {
        int n = s.size(), ans = 0;
        vector<vector<bool>> dp(n,vector<bool>(n, false));
        for(int i = n - 1; i >= 0; --i){
            for(int j = i; j < n; ++j){
                dp[i][j] = (s[i] == s[j]) && (j - i <= 2 || dp[i + 1][j - 1]);
                if(dp[i][j]) ans++;
            }
        }
        return ans;
    }
};