KMP算法

#include<iostream>
#include<string.h>
using namespace std;
void makeNext(char *s, int *next){
    int len = strlen(s);
    int j = 0;
    for(int i = 1; i < len; i++){
       while(j > 0 && s[j + 1 - 1] != s[i + 1 - 1])
           j = next[j];
       if(s[j + 1 - 1] == s[i + 1 - 1]){
            j += 1;
            next[i + 1] = j;
        }
        else
           next[i + 1] = 0;
    }
}
int main(){
    char src[] = "ababaa";
    char src1[] = "abababaab";
    char src2[] = "aaaaaa";
    char src3[] = "abbaabb";
    int *next, *next1, *next2, *next3;
    next = new int[strlen(src) + 1];
    memset(next, 0, (strlen(src) + 1) * sizeof(int));
    makeNext(src, next);
    next1 = new int[strlen(src1) + 1];
    memset(next1, 0, (strlen(src1) + 1) * sizeof(int));
    makeNext(src1, next1);
    next2 = new int[strlen(src2) + 1];
    memset(next2, 0, (strlen(src2) + 1) * sizeof(int));
    makeNext(src2, next2);
    next3 = new int[strlen(src3) + 1];
    memset(next3, 0, (strlen(src3) + 1) * sizeof(int));
    makeNext(src3, next3);
    return 0;
}