//manacher算法,时间复杂度O(n),空间复杂度O(n) int min(int a,int b) { if(a < b) return a; return b; } int max(int a,int b) { if(a > b) return a; return b; } int getLongestPalindrome(char* A )&nb...