KMP算法

1、暴力匹配算法

package algorithm;

public class ViolenceMatch {
    public static void main(String[] args) {
        String str1 = "BBC ABCDAB ABCDABCDABDE";
        String str2 = "ABCDABD";
        System.out.println("index = " + violenceMatch(str1, str2));
    }

    private static int violenceMatch(String str1, String str2) {
        char[] ch1 = str1.toCharArray();
        char[] ch2 = str2.toCharArray();
        int i = 0, j = 0;
        while(i < ch1.length && j < ch2.length) {
            if (ch1[i] == ch2[j]) {
                i++;
                j++;
            } else {
                i = i - j + 1;
                j = 0;
            }
        }

        if (j == ch2.length) {
            return i - j; // 返回匹配字符串的起始位置
        }

        return -1;
    }
}

2、KMP算法（这个是真的难懂！）

算法介绍：

kmp算法_百度百科 (baidu.com)

package algorithm;

public class KMPMatch {
    public static void main(String[] args) {
        String str1 = "BBC ABCDAB ABCDABCDABDE";
        String str2 = "ABCDABD";
        int[] next = kmpNext(str2);
        System.out.println("index = " + kmpMatch(str1, str2, next));
    }

    private static int[] kmpNext(String str) { // ABCDABD
        char[] pattern = str.toCharArray();
        int[] next = new int[pattern.length];
        next[0] = 0;   //  首字符前后缀均为0
        for (int i = 1, j = 0; i < next.length; i++) {  //  变量i指向的是后缀，变量j指向的是前缀
            while (j > 0 && pattern[i] != pattern[j]) {
            j = next[j - 1];
            }
            if (pattern[i] == pattern[j]) {  //  遇到相同字符时，将j+1
                j++;
            }

            next[i] = j;
        }
        return next;
    }

    private static int kmpMatch(String str1, String str2, int[] next) {
        char[] ch1 = str1.toCharArray();
        char[] ch2 = str2.toCharArray();
        int i = 0, j = 0;
        while (i < ch1.length) {
            while (j > 0 && ch1[i] != ch2[j]) {
                j = next[j - 1];
            }
            if (ch1[i] == ch2[j]) {
                j++;
            }
            i++;
            if (j == ch2.length) {   // 条件成立，说明找到了
                return i - j ;
            }
        }
        return -1;
    }
}