KMP
看了一天多的KMP终于有点眉目了,自己在本子总结的,希望以后自己翻起来的时候还能回忆起来。
下面是next的函数推导:
对KMP算法的改进:
基本就是这些了
另外还有一些Java语言写的KMP程序:
package dataStructure;
/**
*@author: yg
*@time:2016-11-12 上午11:40:23
*/
public class kmp3 {
/**
* @param str
* @param sub
*/
private void kmp(String str, String sub) {
// TODO Auto-generated method stub
int j=0;
int[] next =getNext(sub);
for(int i=0;i<str.length(); ){
if(str.charAt(i)==sub.charAt(j)){
i++;
j++;
} else{
if(next[j]==0){
j=0;
i++;
continue;
}else{
j=next[j]-1;
}
}
if(j==next[0]){
j=0;
System.out.println("存在一个这样的字符串,起始位置是="+i);
}
}
}
/**
* @param sub
*/
private int[] getNext(String sub) {
// TODO Auto-generated method stub
String[] arr = sub.split("");
System.out.println(arr[0] + " " + arr[1]);
int[] next = new int[arr.length];
int i = 0;
int j = 0;
next[0] = sub.length();
next[1] = 0;
i = 1;
while (i < next[0]) {
if (j == 0 || arr[i].equals(arr[j])) {
i++;
j++;
if (!arr[i].equals(arr[j])) {
next[i] = j;
} else {
next[i] = next[j];
}
} else {
j = next[j];
}
}
for (int k = 0; k < next.length; k++) {
System.out.println("sss=" + next[k]);
}
return next;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
kmp3 k3 = new kmp3();
String sub = "aaaab";
//k3.getNext(sub);
String str = "aaaabaaadabaaaabaaaab";
k3.kmp(str, sub);
}
}