KMP算法

根据matrix67博客上的思路，自己实现的kmp算法，字符串下标从0开始。
博文地址 ： http://www.matrix67.com/blog/archives/115
#include <cstdio>#include <cstring>const int MAXN = 1000;int P[MAXN];void pre(const char* B){P[0] = -1;int i, j = -1;for (i = 1; i < strlen(B); i++){while (j > -1 && B[j+1] != B[i])j = P[j];if (B[j+1] == B[i])j++;P[i] = j;}}void kmp(const char* A, const char* B){int i, j = -1;for (i = 0; i < strlen(A); i++){while (j > -1 && B[j+1] != A[i])j = P[j];if (B[j+1] == A[i])j++;if (j == strlen(B) - 1){printf("Pattern occurs with shift %d/n", i - strlen(B) + 1);j = P[j];}}}int main(){const char* A = "abababababa", *B = "aba";pre(B);kmp(A, B);return 0;}