搜索资源列表
kmpdijk
- 自己写的dijkstra 和 KMP 算法,写的不好,有需要的自己下-The dijkstra and write KMP algorithm, badly written, there is a need for their next
pipei
- 自己编的中英文混合模式匹配，用KMP算法实现。-Own series of mixed pattern matching, KMP algorithm used.
kmp_Ext
- 运用扩展KMP算法求出某一字符串与另一字符串的所有最长公共前缀-KMP algorithm the extended use of a string with another string of all longest common prefix
KMP
- KMP:在一个长字符串中匹配一个短子串的无回溯算法。-KMP
HString
- 串的基本应用，插入，查找，拷贝，包括kmp算法-string
KMPandBMexample
- KMP算法与BM算法的具体C++实现，很经典的，算法描述清晰，代码演示的是字符川匹配，很不错-KMP algorithm and the BM algorithm to achieve the specific C++, very classic, algorithm descr iption clearly demonstrates that the code matches the character of Sichuan, very good! !
KMP
- 本程序可以实现字符串模式匹配算法，在数据结构C语言版本的基础上，稍微改动了一下，原理参照书上所写的。-This program can be a string pattern matching algorithms, data structures in C language based on slightly changed a bit, principles written in the book reference.
004
- 用于字符串匹配的KMP算法，由于其O(m+n)的时间复杂度，至今仍被广泛应用。-KMP string matching algorithm is used, due to its O (m+ n) time complexity, is still widely used.
Bmsuanfa
- BM算法也是一种快速串匹配算法，BM算法与KMP算法的主要区别是匹配操作的方向不同。-BM algorithm is also a fast string matching algorithms, BM KMP algorithm and matching algorithm is the main difference between operating in a different direction.
java_kmp_algorith
- 利用java语言实现的KMP算法， 可用于字符串模式匹配等项目中-Using java language of the KMP algorithm can be used for string pattern matching and other projects
mian
- KMP 算法实现, 简单直观， 用next函数计算下一个比较位置-KMP algorithm,developed by c++
04strings
- 数据结构中的串用法比较复杂，而且有堪称重头戏的KMP算法，很多读者即使会用也不知道原理，本电子书将对其详细讲述-Use the string data structure is complex, and has called the highlight of the KMP algorithm, many readers do not know if will use the principle of the book will detail its
KMP_algorithm
- 一个通俗易懂的“KMP算法详解”，参加程序设计竞赛的人可能会用到-A user-friendly " KMP algorithm Detailed" who participate in programming contests may be used
jmx1
- 实现字符串的查找功能：BF算法，KMP算法，对上述两个算法进行时间复杂性分析并设计实验程序验证分析结果-Find function for string: BF algorithms, KMP algorithm, the two algorithms of time complexity analysis and experimental design analysis of program verification
KMP
- KMP字符串模式匹配通俗点说就是一种在一个字符串中定位另一个串的高效算法。简单匹配算法的时间复杂度为O(m*n) KMP匹配算法。可以证明它的时间复杂度为O(m+n).-This file contains a summary of what you will find in each of the files that make up your KMP application.
string
- 字符串匹配算法研究 字符串匹配 前缀 后缀 kmp算法 后缀树-with internet booming, the amount of information gets more and more. How to find the target information in such tramendous data is the key in web searching develepment. In this end the string matching algorithm takes
KMPpp
- 利用KMP算法，忽略大小写的字符串匹配 查找子字串在父字串的位置-Use of KMP algorithm, case-insensitive substring string matching to find the location of the parent string
KMP-string-search-algorithm
- C语言KMP字符串搜索算法实现。KMP字符串模式匹配通俗点说就是一种在一个字符串中定位另一个串的高效算法。-C language KMP string search algorithm realization. KMP string pattern matching is a popular point said in a string of the position of another string efficient algorithm.
main
- kmp算法的实现（后面还有一个容错的KMP算法，但是有很严重的问题）。-kmp algorithm implementation (behind the KMP algorithm and a fault-tolerant, but there are serious problems.)
chuanpipei
- 串的最大匹配算法的新思路，课本上讲解的都是KMP算法-Maximum matching algorithm string of new ideas, textbooks are all on the KMP algorithm to explain