大二时学习了KMP模式匹配算法,但是今天偶然被问起,才觉得已经忘得差错不多了,遂复习了一下,参考连接http://blog.csdn.net/yutianzuijin/article/details/11954939,谢谢博主分享。讲的很详细,看之前的几篇都觉得略费劲。
写了一个对比的测试程序,用普通的查找子串的方法和KMP算法作比较,效率的确高很多。
附上测试的程序:
package com.pingan.test.KMP;
import java.util.concurrent.TimeUnit;
import org.junit.Test;
/**
*
* @author MENGHUCHENG012 KMP算法与普通算法对比
*/
public class test1 {
public static void normal(String A, String B) {
boolean flag = true;
int lena = A.length();
int lenb = B.length();
for (int i = 0; i < lena; i++) {
flag = true;
if (A.charAt(i) == B.charAt(0)) {// 第一个字符相同就进入循环
int k = 0;
while (flag && k < lenb) {
if (A.charAt(k + i) != B.charAt(k++)) {
flag = false;
break;
}
}
if (flag) {
System.out.println("find at position :" + i);
}
}
}
}
public static void tesKMP(String original, String find) {
int j = 0;
int[] next = new int[find.length()+1];//从1开始
for (int i = 0; i < original.length(); i++) {
while (j > 0 && original.charAt(i) != find.charAt(j))
j = next[j];
if (original.charAt(i) == find.charAt(j))
j++;
if (j == find.length()) {
System.out.println("find at position :" + (i - j + 1));
System.out.println(original.subSequence(i - j + 1, i + 1));
j = next[j];
}
}
}
@Test
public void test() {
long time1 = System.nanoTime();
normal("abcdabcd", "bcd");
long time2 = System.nanoTime();
System.out.println("normal运行的时间是:" + (time2 - time1));
time1 = System.nanoTime();
tesKMP("abcdabcd", "bcd");
time2 = System.nanoTime();
System.out.println("KMP运行的时间是:" + (time2 - time1));
}
}