时间复杂度:O(n+m)
next数组:若next[i]=k,则next[i]表明当模式中第j个字符与主串中相应字符“失配”时,在模式中需要重新和主串中该字符进行比较的字符的位置。定义如下。
package com.uply.javanetwork;
/**
* @author Uply
* @since 2018/9/16
*/
public class KMP {
/**
*
* @param a 模式
* @param b
* @return
*/
public static boolean compare(String a, String b) {
if (a == null || b == null ||a.length() == 0 || b.length() == 0)
return false;
int[] next = getNext(a);
int i = 1, j = 1;
int alen = a.length(), blen = b.length();
while (i <= alen && j <= blen) {
if (i == 0 || a.charAt(i - 1) == b.charAt(j - 1)) {
i++;
j++;
} else {
i = next[i - 1];
}
}
if (i > alen)
return true;
return false;
}
private static int[] getNext(String str) {
int i = 1, j = 0;
int[] next = new int[str.length()];
next[0] = 0;
while (i < str.length()) {
if (j == 0 || str.charAt(i - 1) == str.charAt(j - 1)) {
i++;
j++;
next[i - 1] = j;
}
else {
j = next[j - 1];
}
}
return next;
}
public static void main(String[] args) {
System.out.println(KMP.compare("abaabcac", "acabaabaabcacaabc"));
for (int i : KMP.getNext("abaabcac"))
System.out.println(i);
}
}