KMP算法C++实现

#include <bits/stdc++.h>
using namespace std;

constexpr unsigned ARR_LEN = 10000;

void calcNext(int next[], unsigned n, char match[])
{
    next[0] = -1;
    next[1] = 0;
    int cn = 0;
    unsigned pos = 2;
    while (pos < n) {
        if (match[pos - 1] == match[cn]) {
            next[pos++] = ++cn;
        } else if (cn > 0) {
            cn = match[cn]; 
        } else {
            next[pos++] = 0;
        }
    }
}

int getIndexOf(char str[], unsigned sn, char match[], unsigned mn, int next[], unsigned nn)
{
    int si = 0;
    int mi = 0;
    while (si < sn && mi < mn) {
        if (str[si] == match[mi]) {
            si++;
            mi++;
        } else if (next[mi] == -1) {
            si++;
        } else {
            mi = next[mi];
        }
    }
    return mi == mn ? si - mi : -1;
}

int main(void)
{
    char str[ARR_LEN];
    char match[ARR_LEN];
    cin.getline(str, ARR_LEN);
    cin.getline(match, ARR_LEN);
    int next[ARR_LEN];
    calcNext(next, strlen(match), match);
    // KMP
    int idx = getIndexOf(str, strlen(str), match, strlen(match), next, strlen(match));
    if (idx == -1) {
        printf("not found!\n");
    } else {
        printf("found at %d.\n", idx);
    }
    return 0;
}