搜索资源列表
mms
- 高效的最长回文子串实现，原创，时间复杂度为O(nlogn)-Efficient realization of the longest palindrome substring, originality, time complexity is O (nlogn)
main
- 找出最长的回文子串，输出的第一行为找到的最长的回文字符串的长度。后面的行应该包括该字符串，字符串两边多余的空格和标点都不需要输出，但字符串中的空格、标点和换行则需要按照原样输出。-To find the longest palindrome substring of the first acts of the output to find the longest palindrome length of the string. Back row should include extra spac
sicily3
- 输入一个字符串（字符串的长度不超过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
huiwen
- 本题要求给定字符串的最长回文子串长度，由于数据量过大，我们使用manacher算法求字符串的最长回文子串长度。-Can you propose an efficient algorithm to find the length of the largest palindrome in a string?
MaxBackTraceSubString
- 最长回文子串的Java实现 经典算法习题之一 可以输出一串字符中最长的重复子串-Java longest palindrome substring exercises to achieve one of the classic algorithm can output a string of characters in the longest repeated substring
longestPalindrome
- 求最长回文子串 第一种解法：动态规划（内存分配较多，且时间复杂度为O(n^2)）第2种解法:Manacher算法-Find the longest palindrome substring First Solution: Dynamic Programming (memory allocation more, and the time complexity is O (n ^ 2)) The second solution: Manacher algorithm
the-longest-palindrome-substring
- 对于给定的一个字符串，求出其中最长的回文子串。其中子串的含义是：在原串中连续出现的字符串片段。本算法采用C++编程，一定是你不错的选择！-For a given string,we should find the longest palindrome substring. Which means that the substring: string fragment in the original string of consecutive. The algorithm uses the C++
Longest-Palindromic-Substring
- //动态规划求最长回文子串 //用布尔型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
LongPlind_Remove
- 寻找回文子串是一道经典的面试题，本代码旨在解决字符可删情况下的寻找最长回文子串问题。-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.
Manacher_Longest_Subsequence
- 求一个字符串的最长回文子串的长度。比如字符串 abaaba 的最长回文子串的长度就是6.-Seeking a string longest palindromic substring length. For example, the string " abaaba" longest palindromic substring length is 6.
最长回文字符串
- 给定一个字符串，找出该字符串的最长回文子串。(Given a string, find the longest palindrome substring of the string.)