高效的最长回文子串实现，原创，时间复杂度为O(nlogn)-Efficient realization of the longest palindrome substring, originality, time complexity is O (nlogn)