KMP算法,全称Knuth-Morris-Pratt算法,根据三个作者Donald Knuth、Vaughan Pratt、James H. Morris的姓氏的首字母拼接而成的。是一种字符串匹配的算法,用于在一个文本串S中查找模式串P的位置。
public class KMP {
public static void main(String[] args) {
String x = "abcdefg", y = "cde";
int[] next = new int[y.length()];
for (int i = 2, j = 0; i <= y.length(); i++) {
while (j != 0 && y.charAt(i - 1) != y.charAt(j)) j = next[j - 1];
if (y.charAt(i - 1) == y.charAt(j)) j++;
next[i - 1] = j;
}
for (int i = 1, j = 0; i <= x.length(); i++) {
while (j != 0 && x.charAt(i - 1) != y.charAt(j)) j = next[j - 1];
if (x.charAt(i - 1) == y.charAt(j)) {
j++;
}
if (j == y.length()) {
System.out.println(x.substring(i - j, i));
j = next[j - 1];
}
}
}
}