计算不同回文子串的个数

std::vector<int> manacher(std::string s) {
    std::vector<int> t{0};
    for (auto c : s) {
        t.push_back(c);
        t.push_back(0);
    }
    int n = t.size();
    std::vector<int> r(n);
    for (int i = 0, j = 0; i < n; i++) {
        if (2 * j - i >= 0 && j + r[j] > i) {
            r[i] = std::min(r[2 * j - i], j + r[j] - i);
        }
        while (i - r[i] >= 0 && i + r[i] < n && t[i - r[i]] == t[i + r[i]]) {
            r[i] += 1;
        }
        if (i + r[i] > j + r[j]) {
            j = i;
        }
    }
    return r;
}


class Solution {
public:
    int countSubstrings(std::string s) {
        std::vector<int> r = manacher(s);
        int count = 0;
        for (int i = 1; i < r.size() - 1; ++i) {
            count += r[i] / 2;
        }
        return count;
    }
};