搜索资源列表
10253
- 本代码是在KMP算法上加以改进后，实现对一个字串求最长重复子序列。该算法可以与后缀树有相同原理。-The code is in the KMP algorithm be improved to realize for the longest string of a repeat sequence. The suffix tree algorithm with the same principle.
main
- 倍增法构建后缀数组 求最大重复子串的C程序-Constructing the suffix array multiplication seeking to repeat the largest sub-string C-program
string_structure
- 关于字符串的数据结构应用，有kmp，扩展kmp，单词前缀树的近似kmp，后缀数组。求最多重复子串。-On the string data structure applications, kmp, expansion kmp, word prefix tree approximation kmp, suffix array. Seeking up to repeated substring.
lengthOfLongestSubstring
- 求最长不重复子串，利用哈希表求解的,leetcode中的题目-Not repeated for the longest substring, use a hash table to solve the
Longest-repeated-substring
- 一个计算字符串中最长重复子串的算法，开发语言是C/C-A string of the longest repeated substring algorithm development of language is C/C++
KMP
- KMP算法解决了BF算法效率低下的问题，并且在子串前缀重复时进行了性能优化-KMP algorithm solves the problem of low efficiency of BF algorithm, and when the prefix substring repeat performance optimization