使用C语言编写的基于链串的动态键盘输入链串三种模式匹配算法（包括BF算法、RK算法和KMP算法）的完整代码并计算代码运行的时间

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

// BF算法
int BF(char *text, char *pattern) {
    int n = strlen(text);
    int m = strlen(pattern);
    int i, j;
    for (i = 0; i <= n - m; i++) {
        j = 0;
        while (j < m && text[i + j] == pattern[j]) {
            j++;
        }
        if (j == m) {
            return i;
        }
    }
    return -1;
}

// RK算法
int RK(char *text, char *pattern) {
    int n = strlen(text);
    int m = strlen(pattern);
    int i, j;
    int d = 256; // 字符集大小
    int q = 101; // 一个较大的素数
    int h = 1;
    int p = 0; // 模式串的哈希值
    int t = 0; // 文本串的哈希值

    // 计算 h = d^(m-1)
    for (i = 0; i < m - 1; i++) {
        h = (h * d) % q;
    }

    // 计算模式串的哈希值 p 和文本串的哈希值 t
    for (i = 0; i < m; i++) {
        p = (d * p + pattern[i]) % q;
        t = (d * t + text[i]) % q;
    }

    // 在文本串中滑动模式串进行匹配
    for (i = 0; i <= n - m; i++) {
        if (p == t) {
            for (j = 0; j < m; j++) {
                if (text[i + j] != pattern[j]) {
                    break;
                }
            }
            if (j == m) {
                return i;
            }
        }
        if (i < n - m) {
            t = (d * (t - text[i] * h) + text[i + m]) % q;
            if (t < 0) {
                t += q;
            }
        }
    }
    return -1;
}

// KMP算法
void getNext(char *pattern, int *next) {
    int m = strlen(pattern);
    int i = 0, j = -1;
    next[0] = -1;
    while (i < m) {
        if (j == -1 || pattern[i] == pattern[j]) {
            i++;
            j++;
            next[i] = j;
        } else {
            j = next[j];
        }
    }
}

int KMP(char *text, char *pattern) {
    int n = strlen(text);
    int m = strlen(pattern);
    int i = 0, j = 0;
    int *next = (int *)malloc(sizeof(int) * m);
    getNext(pattern, next);
    while (i < n && j < m) {
        if (j == -1 || text[i] == pattern[j]) {
            i++;
            j++;
        } else {
            j = next[j];
        }
    }
    free(next);
    if (j == m) {
        return i - j;
    } else {
        return -1;
    }
}

int main() {
    char text[100];
    char pattern[100];
    printf("请输入文本串：");
    scanf("%s", text);
    printf("请输入模式串：");
    scanf("%s", pattern);

    clock_t start, end;
    double cpu_time_used;

    // BF算法
    start = clock();
    int bfIndex = BF(text, pattern);
    end = clock();
    cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;
    printf("BF算法匹配结果：%d\n", bfIndex);
    printf("BF算法运行时间：%f秒\n", cpu_time_used);

    // RK算法
    start = clock();
    int rkIndex = RK(text, pattern);
    end = clock();
    cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;
    printf("RK算法匹配结果：%d\n", rkIndex);
    printf("RK算法运行时间：%f秒\n", cpu_time_used);

    // KMP算法
    start = clock();
    int kmpIndex = KMP(text, pattern);
    end = clock();
    cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;
    printf("KMP算法匹配结果：%d\n", kmpIndex);
    printf("KMP算法运行时间：%f秒\n", cpu_time_used);

    return 0;
}