KMP算法(看毛片算法)
发布时间:2020-12-14 06:28:47 所属栏目:Java 来源:网络整理
导读:这里是KMP算法的原文: 我根据原文理解,修改为java版的.... " " 我这边也是: 多的就不用说了,直接上代码: String[] zstr = { "a","b","a","c","d","c" String[] mstr = { "b","c" index = (index == -1 System.out.println("没有匹配的字符串!" } Syste
这里是KMP算法的原文: 我根据原文理解,修改为java版的.... "" 我这边也是: 多的就不用说了,直接上代码:
String[] zstr = { "a","b","a","c","d","c"
String[] mstr = { "b","c"
index =
(index == -1 System.out.println("没有匹配的字符串!" } System.out.println("哈哈,找到字符啦,位置为:" +
i = 0 j = 0
[] next =
(i < bigstr.length && j < (j == -1 || bigstr[i] == i++ j++ } j =
(j == i -
-1
k = -1
j = 0
[] next =
next[j] = -1
(j < smallstr.length - 1 (k == -1 || smallstr[k] == next[j+1]=next[j]+1
next[++j] = ++ }
k =
}
运行结果: (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |