BF算法

#include<stdio.h>
#include<string.h>

int BF(char *A, char *B) {
    int i = 0,j=0;
    while(i < strlen(A) && j < strlen(B)) {
        if(A[i]==B[j]) {
            i++;
            j++;
        } else {
            i = i - j + 1;    //j代表j（i）移动的距离，i返回初始位置再从下一个开始 
            j = 0;
        }
    }
    if(j == strlen(B)) 
        return i - strlen(B) + 1;    //加一是第几个，不加一是下标 
        
    return -1;
}

int main() {
    char *A = "ababcabcacbab";
    char *B = "abcac";
    int num = BF(A, B);
    printf("A = %s\nB = %s\n", A, B);
    printf("number = %d\n",num);

    return 0;
}