** 朴素模式匹配算法、kmp模式匹配算法、kmp模式匹配算法改进。java代码**
思路过段时间整理~ 可以先看看阮一峰的这篇博客,字符串匹配的KMP算法
package edu.hubu.base;
/**
* Created by 张狄
* 2018-07-19 15:31
*/
public class KMPbook {
public static void main(String[] args) {
String str = "abcsdfasdfafahhtshhjjagkababaaabagak;shdgl;ahgnakhnjkljdkjkjdef";
String str1 = "ababaaaba";
int[] test = next(str1);
for (int i:test
) {
System.out.printf(i+",");
}
System.out.println("\n");
//优化后
int[] testval = nextval(str1);
for (int i:testval
) {
System.out.printf(i+",");
}
System.out.println("\n");
//朴素
int test1 = findIndex(str, str1, 1);
//kmp
int test2 = index_KMP(str, str1, 1);
//kmp
int test3 = index_KMPval(str, str1, 1);
System.out.println(test2+":"+test1+":"+test3);
}
/**
* 朴素模式匹配算法
* @param s
* @param t
* @param pos
* @return
*/
public static int findIndex(String s,String t,int pos) {
char[] cs = s.toCharArray();
char[] ct = t.toCharArray();
int i = pos, j = 1;
if (pos <= 0) {
return -1;
}
while (j <= ct.length&&i <= cs.length ) {
if (cs[i - 1] == ct[j - 1]) {
++i;
++j;
} else {
i = i - j + 2;
j = 1;
}
}
if (j > ct.length) {
return i - ct.length;
} else {
return -1;
}
}
/**
* 获取下一步长位置
* @param module
* @return
*/
private static int[] next(String module) {
int[] _next = new int[module.length()];
int i = 1, j = 0;
_next[0] = 0;
while (i < module.length()) {
if (j == 0 || module.charAt(i-1) == module.charAt(j-1)) {
++i;
++j;
_next[i-1] = j;
} else {
j = _next[j-1];//字符不相同j值回溯
}
}
return _next;
}
/**
* 常规kmp模式匹配算法
* @param s
* @param t
* @param pos
* @return
*/
private static int index_KMP(String s, String t, int pos) {
char[] cs = s.toCharArray();
char[] ct = t.toCharArray();
int i = pos, j = 1;
int[] _next = next(t);
if (pos <= 0) {
return -1;
}
while (j <= ct.length&&i <= cs.length ) {
if (j==0||cs[i - 1] == ct[j - 1]) {//两字母相等则继续,相对朴素算法增加了j=0判断。
++i;
++j;
} else {//指针后退重新开始匹配
j = _next[j-1];//j退回合适的位置,i值不变。
}
}
if (j > ct.length) {
return i - ct.length;
} else {
return -1;
}
}
/**
* 优化后获取下一步长位置
* @param module
* @return
*/
private static int[] nextval(String module) {
int[] _next = new int[module.length()];
int i = 1, j = 0;
_next[0] = 0;
while (i < module.length()) {
if (j == 0 || module.charAt(i-1) == module.charAt(j-1)) {
++i;
++j;
if (module.charAt(i - 1) != module.charAt(j - 1)) {
_next[i - 1] = j;
} else {
_next[i - 1] = _next[j - 1];
}
} else {
j = _next[j-1];//字符不相同j值回溯
}
}
return _next;
}
/**
* 优化后kmp模式匹配算法
* @param s
* @param t
* @param pos
* @return
*/
private static int index_KMPval(String s, String t, int pos) {
char[] cs = s.toCharArray();
char[] ct = t.toCharArray();
int i = pos, j = 1;
int[] _nextval = nextval(t);
if (pos <= 0) {
return -1;
}
while (j <= ct.length&&i <= cs.length ) {
if (j==0||cs[i - 1] == ct[j - 1]) {
++i;
++j;
} else {
j = _nextval[j-1];
}
}
if (j > ct.length) {
return i - ct.length;
} else {
return -1;
}
}
}