在O(n)或O(n log n)中发现回文子串数?

I know you can find the longest palindromic substring in O(n) with manacher's algorithm, but is it possible to find the total I know you can find the longest palindromic sub