SDUT - 2772 数据结构实验之串一：KMP简单应用

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char a[1000005], b[1000005];
int next[1000005];
void pre(char a[], int n)
{
    int i, j;
    j = next[0] = -1;
    i = 0;
    while(i < n)
    {
        while(j != -1 && a[i] != a[j])j = next[j];
        next[++i] = ++j;
    }
    return ;
}
int kmp(char a[], int n, char b[], int m)
{
    int i, j;
    pre(b, m);
    i = j = 0;
    while(i < n)
    {
        while(j != -1 && a[i] != b[j])j = next[j];
        i++;j++;
        if(j >= m)
        {
            return i - m + 1;
        }
    }
    return -1;
}
int main()
{
    while(scanf("%s %s", a, b) != EOF)
    {
        getchar();
        int ans = kmp(a, strlen(a), b, strlen(b));
        printf("%d\n", ans);
    }
    return 0;
}