首先来 BF
//BF算法, 超时
public int strIndexOf(String str1, String str2){
if (str1.length() < str2.length()) return -1;
if (str1.length() == 0 || str2.length() == 0) return 0;
int i;
for (i = 0; i < str1.length(); i++) {
int index = i;
int j;
int count = 0;
for (j = 0; j < str2.length() ; j++) {
if (index < str1.length() && str1.charAt(index++) == str2.charAt(j)){
count++;
}else break;
if (count == str2.length()) return i;
}
}
return -1;
}
KMP算法
public int KMPStr(String str1, String str2){
if (str2.length() == 0) return 0;
int n = str1.length(), m = str2.length();
str1 = " " + str1;
str2 = " " + str2;
char[] s = str1.toCharArray();
char[] p = str2.toCharArray();
int[] next = new int[m + 1];
//构造 next 数组 构造过程 i = 2,j = 0 开始,i 小于等于匹配串长度 【构造 i 从 2 开始】
for (int i = 2, j = 0; i <= m; i++) {
// 匹配不成功的话,j = next(j)
while (j > 0 && p[i] != p[j + 1]) j = next[j];
// 匹配成功的话,先让 j++
if (p[i] == p[j + 1]) j++;
// 更新 next[i],结束本次循环,i++
next[i] = j;
}
// 匹配过程,i = 1,j = 0 开始,i 小于等于原串长度 【匹配 i 从 1 开始】
for (int i = 1, j = 0; i <= n; i++) {
// 匹配不成功 j = next(j)
while (j > 0 && s[i] != p[j + 1]) j = next[j];
// 匹配成功的话,先让 j++,结束本次循环后 i++
if (s[i] == p[j + 1]) j++;
// 整一段匹配成功,直接返回下标
if (j == m) return i - m;
}
return -1;
}