文件名称:KMP008
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
串的模式匹配的朴素算法是O(N^2)的, 可以
利用KMP(由D.E.Knuth, J.H.Morris, V.R.Pratt提出)算法改进至线性的算法. KMP算法与朴素算法的不同在于：处理"失配"情况. 不同于将指针完全回溯, KMP算法先根据已经部分匹配的信息, 将匹配的指针跳过不必匹配的位置.-Series of simple pattern matching algorithm is O (N ^ 2), and can make use of KMP (from DEKnuth, JHMorris, VRPratt made) algorithm to improve the algorithm to linear. KMP algorithm and simple algorithm is different: the " mismatch" situation. pointer completely different to back, KMP algorithm first part of the basis of information match, the pointer will skip the match do not have to match the position.相关搜索： kmp
java
simple
kmp
java
利用KMP(由D.E.Knuth, J.H.Morris, V.R.Pratt提出)算法改进至线性的算法. KMP算法与朴素算法的不同在于：处理"失配"情况. 不同于将指针完全回溯, KMP算法先根据已经部分匹配的信息, 将匹配的指针跳过不必匹配的位置.-Series of simple pattern matching algorithm is O (N ^ 2), and can make use of KMP (from DEKnuth, JHMorris, VRPratt made) algorithm to improve the algorithm to linear. KMP algorithm and simple algorithm is different: the " mismatch" situation. pointer completely different to back, KMP algorithm first part of the basis of information match, the pointer will skip the match do not have to match the position.相关搜索： kmp
java
simple
kmp
java
(系统自动生成,下载前可以参看下载内容)
下载文件列表
KMP008.txt