Leetcode 647. 回文子串 题解（Shout out to 橙子哥）

题目链接：https://leetcode-cn.com/problems/palindromic-substrings/

看了大佬的题解，整理代码如下：

一、中心扩展法

class Solution {
public:
    int countSubstrings(string s) {
        if (s.empty()) return 0;
        int size = s.size(), res = 0;
        for (int i = 0; i < size; ++i) {
            helper(s, i, i, res);
            helper(s, i, i + 1, res);
        }
        return res;
    }

    void helper(string &s, int i, int j, int &res) {
        while (i >= 0 && j < s.size() && s[i] == s[j]) {
            --i, ++j, ++res;
        }
    }
};

二、动态规划法

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