搜索资源列表
Zhu-Takaoka algorithm
- 一个关于字符串匹配的算法,已经经过编译,希望对你有帮助- About the character string match algorithm, already passed through the translation, hoped had to you helps
kmp Algorithm
- 这是一个关于字符串匹配的kmp算法,程序简单精炼,可以借鉴一下-This is a match on the string of KMP algorithm, a simple refining process, we can draw about
Las Vegas
- 关于字符串匹配的拉斯维加斯算法,有不好的地方请指正-on the Las Vegas string matching algorithm, the bad Hi
kmpEx
- KMP算法是字符串模式匹配算法, 解决DBCS字符集的问题。-KMP algorithm is a string pattern matching algorithms, DBCS characters to solve the problem,.
regexp_source
- 一个字符串匹配、查找替换算法的代码,支持各种通配符-a string matching algorithm to search the replacement code, support wildcards
dist2
- 字符串匹配的BM算法,完全自己做出来的, 大家可以拿去参考,一切分享-BM string matching algorithm, completely on my own to do it, we can spend reference, all sharing
StringMatchAlgorithms
- 数据结构中字符串匹配的三种经典算法--KMP算法、MonteCarlo算法、LasVegas算法。分别实现将两个0/1串的匹配。并作为比较。Java语言编写。-data structure string matching algorithm of the three classics-- KMP algorithm. Monte Carlo algorithm, the algorithm LasVegas. Achieve two w
macth
- 字符串匹配问题,采用KMP算法,匹配速度快-String matching problems, the use of KMP algorithm, matching speed
KMP
- 著名的KMP算法 实现快速字符串匹配 其中还包括失效函数的实现-KMP famous fast string matching algorithm which also includes the realization of failure function
KMPMatch
- 经典算法实现,KMP字符串匹配,环境为vc2005-Classical algorithm, KMP string matching, the environment for vc2005
BM
- java 实现的BM算法。 BM算法是一种字符串匹配算法。-java realize the BM algorithm. BM algorithm is a string matching algorithm.
kmp_algorithm
- 自己编写的字符串匹配算法-经典的KMP算法,该算法当模式与主串之间存在许多“部分匹配”时能显示出其时间优越性。-I have written a string matching algorithm- the classical KMP algorithm when the model and between the main strings there are many
random_algorithm
- 一种采用数学方法实现的字符串匹配算法-模式匹配的随机算法。-Mathematical methods used to achieve a string matching algorithm- the random pattern-matching algorithm.
zfpp
- 经曲的字符串匹配模糊搜索算法 思想不是本人的,但程序是本人编写的-By the song
EditDistance
- 用动态规划算法思想求最小编辑距离,即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
SomeProgramForDataStructure
- KMP字符串匹配的c实现,测试字符串为char a[20]="abcdefghijk" char b[20]="abcdefgg" 取各位数字的算法,最大有效测试数据长整形最N=100000000 贪婪算法:已知若干面值的人名币,如何找零钱,使张数最小,测试面值a[4]={25,10,5,1} 快速排序C++实现-KMP string matching c to achieve the test string to char a
bm
- BM可以说是继KMP算法之后更加 优秀的字符串匹配算了,BM 是大师Boyer-Moore的算法杰作, 所以称BM算法, 相比KMP算法效率提高了不少, -BM can be said that after following the KMP algorithm for string matching better forget, BM is the master of the Boyer-Moore algorithm m
KMP
- 求解KMP算法,用的是c++语言进行编写,KMP是一种迅速的字符串匹配算法,输入文本和要匹配的字符串即可-a solution of KMP alogorithms
KMP
- KMP 模式匹配算法实例 C++源码 字符串查找-KMP pattern matching algorithm in C++ source code search string
vckmp
- KMP 算法是由Knuth,Morris和Pratt等人共同提出的,所以成为Knuth-Morris-Pratt算法,简称KMP算法。KMP算法是字符串模式匹配中的经典算法。和BF算法相比,KMP算法的不同点是匹配过程中,主串的位置指针不会回溯,这样的结果使得算法时间复杂度只为O(n+m)。 采用VC++开发,实现KMP字符串匹配算法-KMP algorithm by Knuth, Morris and Pratt, who co-