输入一个字符串（字符串的长度不超过100），求出其中最长的回文子串的长度。子串的含义是：在原串中连续出现的字符串片段。回文的含义是：正着看和倒着看相同，如abba和yyxyy。-Enter a string (the length of the string is not more than 100), calculated the length of the longest palindrome substring. The substring meaning: the string frag

本题要求给定字符串的最长回文子串长度，由于数据量过大，我们使用manacher算法求字符串的最长回文子串长度。-Can you propose an efficient algorithm to find the length of the largest palindrome in a string?

//动态规划求最长回文子串 //用布尔型t[i][j]表示子串（s(i....j))是否为回文子串 //其中t[i][j]的值可通过t[i+1][j-1]的值以及是s[i]和s[j]是否相等判断（即子串（s(i...j))是否为回文子串可通过子问题s（i+1,...,j-1)是否为回文串来解决） //通过left和right来指示当前最长回文子串的下标-// Dynamic programming longest palindrome substring // Boolean t

寻找回文子串是一道经典的面试题，本代码旨在解决字符可删情况下的寻找最长回文子串问题。-Finding the longest palindromic substring is one of the most typical face questions, the source code uploaded is aimed to finding the longest palindromic substring while the characters are removable.

给定一个字符串，找出该字符串的最长回文子串。(Given a string, find the longest palindrome substring of the string.)