Welcome![Sign In][Sign Up]
Location:
Search - KMP

Search list

[Data structsKMP

Description: KMP算法 在一个长字符串中匹配一个短子串的无回溯算法-KMP algorithm
Platform: | Size: 1024 | Author: ooooo825 | Hits:

[Data structskmp

Description: KMP算法的一个实例。输入目标串和模板串返回为查找成功的位置-An example of KMP algorithm. Enter the target string and the template for the search string to return to the location of the successful
Platform: | Size: 1024 | Author: zz | Hits:

[Data structskmp

Description: KMP算法,能够实现字符串的模式匹配!C++语言实现!-KMP 算法,能够实现字符串的模式匹配!
Platform: | Size: 1024 | Author: chen | Hits:

[Data structskmp

Description: 快速实现模式匹配的kmp算法,时间复杂度仅为O(n*m)-Rapid kmp pattern matching algorithm, time complexity is only O (n* m)
Platform: | Size: 1024 | Author: xin | Hits:

[OtherKMP

Description: Knuth-Morris-Prath Pattern Matching algorithm in Matlab
Platform: | Size: 1024 | Author: daniel769 | Hits:

[Data structsKMP

Description: KMP。。对于ACM极其有用哦-KMP
Platform: | Size: 18432 | Author: 杨杰 | Hits:

[MPIMPI-StringMatch

Description: KMP串匹配、随机串匹配、近似串匹配的并行算法源码。-KMP string matching, randomized string matching, parallel algorithm for approximate string matching source code.
Platform: | Size: 10240 | Author: 不死鸟 | Hits:

[Windows Developacm

Description: ACM算法模板,包含了绝大多数的算法 ,KMP,SEG-TREE,高精度模板-ACM algorithm template that contains the majority of algorithms, KMP, SEG-TREE, high-precision template
Platform: | Size: 396288 | Author: Jelly | Hits:

[OtherKMP

Description: KMP字符串匹配算法 KMP字符串匹配算法-KMPKMPKMPKMPKMPKMPKMP
Platform: | Size: 146432 | Author: longliu | Hits:

[Data structsKMP

Description: KMP算法的实现,算法复杂度为O(m+n),C++。-KMP Algorithm, algorithm complexity is O (m+ n), C++.
Platform: | Size: 1024 | Author: 苏鸿星 | Hits:

[Data structsKMP

Description: KMP算法的一个小型实现...可能太菜了点-KMP algorithm is an implementation ... may be too small dishes of point ...
Platform: | Size: 1024 | Author: Lelouch | Hits:

[Software Engineeringkmp

Description: 介绍了KMP算法的基本内容和程序,这时数据结构内容的一部分!谢谢分享!-KMP
Platform: | Size: 117760 | Author: 杨战 | Hits:

[Mathimatics-Numerical algorithmsKMP

Description: C语言KMP字符串搜索算法实现 -C-KMP string search algorithm
Platform: | Size: 5120 | Author: 林海涵 | Hits:

[VC/MFCKMP

Description: 一个关于KMP算法的论文,很好很有用,用C语言描述-A paper on the KMP algorithm, very good very useful, using C language to describe the ...
Platform: | Size: 53248 | Author: 刘加 | Hits:

[JSP/JavaTest_KMP

Description: 基于Java开发的KMP例子,教学中关于KMP算法的研究-This is about KMP created on Java
Platform: | Size: 20480 | Author: legend | Hits:

[OtherKMP

Description: 使用KMP算法能减少完成的串模式匹配的回溯,因此该算法每当一趟匹配过程中出现字符比较不等时,不需要回溯i指针,而是利用已匹配到的“部分匹配”的结果将模式右滑尽可能远的一段距离进行比较-KMP algorithm can reduce the use of string pattern matching complete retrospective, so the algorithm whenever the character appears in a visit the matching process more unequal, i do not need to back a pointer, but the use has been matched to a " partial match" results will be right-slip model as far a distance to compare
Platform: | Size: 16384 | Author: 吴正学 | Hits:

[Mathimatics-Numerical algorithmsvckmp

Description: 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-sponsored, so as Knuth-Morris-Pratt algorithm, called KMP algorithm. KMP algorithm is a classical string pattern matching algorithm. And the BF algorithm is compared, KMP algorithm is different from the matching process, the location of the main string pointer will not go back, this result makes the algorithm time complexity only O (n+ m). Using VC++ development, implementation KMP string matching algorithm
Platform: | Size: 610304 | Author: 宇烁 | Hits:

[Mathimatics-Numerical algorithmskmp

Description: kmp算法:在一个长字符串中匹配一个短子串的无回溯算法。-kmp algorithm: a long string of matches in a short sub-strings of non-backtracking algorithm.
Platform: | Size: 1024 | Author: windia | Hits:

[Data structsKMP

Description: KMP是一种字符串查找算法,具有无需回溯的特点,效率高,本源码实现了KMP算法-KMP
Platform: | Size: 4096 | Author: ybelieve | Hits:

[Data structsKMP

Description: KMP算法的具体实现,能够在O(n+m)时间内找出字串在父串中的位置,n为父串长度,m为字串长度-KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length
Platform: | Size: 635904 | Author: chenchencehn | Hits:
« 1 2 3 4 5 6 78 9 10 11 12 ... 30 »

CodeBus www.codebus.net