搜索资源列表
repeat
- 最长重复子串问题 .问题描述: 在一个特定字符串str 中,多次出现的子串称为重复子串。如果字符串str 中有多个重复 子串,则其中长度最长的子串称为最长重复子串。例如,str=’abcdacdac’ ,则子串’cdac’ 是str 的最长重复子串。 .编程任务: 给定一个字符串str ,编程计算str 的最长重复子串。-longest repeated substrings problems. Problem descr iption : In
repeat9
- 给定一个字符串str,编程计算str 的最长重复子串。-given a string str, programming calculation str repeat of the longest substring.
back
- 后缀数组的构造,实现了对字符串的子串的匹配及最长重复子串的查找
重复子串
- 查找字符串中子最长串
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
MCSP
- 计算两个字符串的最小公共子串划分(MCSP)。最小公共子串划分(MCSP)是指把两个字符串划分成相同的子串的集合,同时要求划分的子串数目最少。比如,S1 = cdabcdabceab,S2 = abceabcdabcd,求得的MCSP是(cdabcd, abceab), (abceab, cdabcd).MCSP问题是基因重组中的关键问题,并且与用逆转重复字串进行排序的问题十分相近。MCSP问题是NP难的。-The code is to compute MCSP of two given str
repeat
- 在给定的字符串(必为某一子串的N次重复)内,求最大重复度-In a given string (must be for a sub-string of N times repetition), find the maximum repeatability
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.
string
- 设计string类 要求: 1、为该类定义构造函数,析构函数和赋值操作。构造函数至少应有三个:无参构造函数、C风格字符串构造函数和复制构造函数 2、为string类提供必要的成员函数,可以参考C++类库的string类提供了那些成员函数,至少应包括下标访问,子串查找、获得C风格字符串、获得字符串长度、字符串比较这几个函数 3、利用该string类完成测试程序:统计一个文本文件中所有包含给定子串的单词,并按字典序无重复的打印输出这些单词-Design
back
- 后缀数组的构造,实现了对字符串的子串的匹配及最长重复子串的查找-Suffix array construction, the realization of a substring of string matching and longest repeat substring search
1
- 求串中最长重复子串 数据结构 习题 c++编写-Repeat for the longest substring
diyigezuichangchongfuzichuan
- 求串s中出现的第一个最长重复子串及其位置,数据结构程序-The first position and the longest substring repeat request string s that appear in the data structure of the program
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
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++
SORcalledrspeated
- 最长重复子串问题 ,问题描述: 在一个特定字符串str 中,多次出现的子串称为重复子串-Repeat longest substring problem, problem descr iption: in a specific string STR, multiple occurrences of the substring called repeated substrings
95498411
- 最长重复子串问题 ,问题描述: 在一个特定字符串str 中,多次出现的子串称为重复子串(Repeat longest substring problem, problem descr iption: in a specific string STR, multiple occurrences of the substring called repeated substrings)
ljngqst__problem
- 最长重复子串问题 ,问题描述: 在一个特定字符串str 中,多次出现的子串称为重复子串(Repeat longest substring problem, problem descr iption: in a specific string STR, multiple occurrences of the substring called repeated substrings)
LongestSubstr
- 从一个字符串中找到一个连续子串,该子串中任何两个字符不能相同,求子串的最大长度并输出一条最长不重复子串。(From a string to find a continuous substring, any two characters cannot be the same substring, the maximum length of her series and output a maximum repeat substring.)