KMP算法java实现

给定字符串str1和str2，求str2在str1中的位置，若str1中不包含str2子串，返回-1；

public class KMPTest {
    public static int getIndexOf(char[] str1, char[] str2) {
        if (str2.length > str1.length) {
            return -1;
        }
        int[] next = getNextArray(str2);
        int i1, i2;
        i1 = i2 = 0;
        while (i1 < str1.length && i2 < str2.length) {
            if (str1[i1] == str2[i2]) {
                i1++;
                i2++;
            } else if (next[i2] == -1) {
                i1++;
            } else {
                i2 = next[i2]; //索引回退到左边最长后缀开始的位置
            }
        }
        return i2 == str2.length ? i1 - i2 : -1;
    }

    //求最长前缀和最长后缀的匹配长度：前缀不包括最后一个字符，后缀不包括最开始一个字符
    public static int[] getNextArray(char[] str) {
        if (str.length == 1) return new int[] {-1};
        int[] next = new int[str.length];
        next[0] = -1;
        next[1] = 0;
        int i = 2;
        int cn = 0;
        while (i < next.length) {
            if (str[i-1] == str[cn]) {
                next[i++] = ++cn;
            } else if (cn > 0) {
                cn = next[cn];
            } else {
                next[i++] = 0;
            }
        }
        return next;
    }

    public static void main(String[] args) {
        String s1 = "jfiejofjeojf";
        String s2 = "ejoj";
        System.out.println(getIndexOf(s1.toCharArray(),s2.toCharArray()));
    }
}