1.暴力匹配
/**
* 暴力匹配
* @param str
* @param pattern
* @return
*/
private static int violentMatch(char[] str, char[] pattern){
for (int i = 0; i < str.length; i++) {
for (int j = 0; j < pattern.length; j++) {
if (str[i + j] != pattern[j]){
i++;
break;
}
if (j == pattern.length -1){
return i;
}
}
}
return -1;
}
2.kmp算法匹配
/**
* 获取next值
* @param pattern
* @param next
*/
private static void getNext(char[] pattern, int[] next) {
int i = 0, j = -1;
next[0] = -1;
while (i < pattern.length) { //ddjljdj
if (j == -1) {
i++;
j++;
} else if (pattern[i] == pattern[j]) {
i++;
j++;
next[i] = j;
} else {
j = next[j];
}
}
}
/**
* kmp 字符串匹配
* @param str
* @param pattern
* @param next
* @return
*/
private static int search(char[] str, char[] pattern, int[] next) {
// 判断第0个索引位置能否匹配成功,
int k = 0;
while (k < pattern.length) {
if (str[k] != pattern[k]) {
break;
}
if (k == pattern.length - 1) {
return 0;
}
k++;
}
int i = 0, j = -1;
while (i < str.length && j < pattern.length) {
if (j == -1 || str[i] == pattern[j]) {
i++;
j++;
} else {
j = next[j];
}
}
if (j == pattern.length) {
return i - j;
}
return -1;
}