Method kmp

contents/algorithm/code/KMPTest.java:33–49

()

    }

    static int kmp() {
        int count = 0;
        for (int i = 0, j = 0; i < T.length(); i++) {
            while (j > 0 && T.charAt(i) != P.charAt(j))
                j = fail[j-1];
            if (T.charAt(i) == P.charAt(j)) {
                if (j == N-1) { // 끝까지 왔음
                    j = fail[j];
                    count ++;
                    match_index.append(i-N+2).append("\n");
                } else {
                    j ++;
                }
            }
        }
        return count;
    }
}