GeeksforGeeks（C语言KMP）

原网址：https://www.geeksforgeeks.org/kmp-algorithm-for-pattern-searching/

（1）求lps数组，分两种情况判断，匹配前一段字符串最大相等前缀和后缀分别添加一个字符的情况

（2）相等情况，动态规划，不等情况，回溯法：利用传递性，a=b,b=c,那么a=c

（3）匹配字符串，注意利用前缀和后缀的最大相等长度

// C++ program for implementation of KMP pattern searching 
// algorithm 
#include <bits/stdc++.h> 

void computeLPSArray(char* pat, int M, int* lps); 

// Prints occurrences of txt[] in pat[] 
void KMPSearch(char* pat, char* txt)  { 
    int M = strlen(pat); 
    int N = strlen(txt); 

    // create lps[] that will hold the longest prefix suffix 
    // values for pattern 
    int lps[M]; 

    // Preprocess the pattern (calculate lps[] array) 
    computeLPSArray(pat, M, lps); 

    int i = 0; // index for txt[] 
    int j = 0; // index for pat[] 
    while (i < N) { 
	if (pat[j] == txt[i]) { 
	    j++; 
	    i++; 
	} 

	if (j == M) { 
	    printf("Found pattern at index %d ", i - j); 
	    j = lps[j - 1]; 
	} 

	// mismatch after j matches 
	else if (i < N && pat[j] != txt[i]) { 
	    // Do not match lps[0..lps[j-1]] characters, 
	    // they will match anyway 
		if (j != 0) j = lps[j - 1]; 
		else i = i + 1; 
	} 
    } 
} 

// Fills lps[] for given patttern pat[0..M-1] 
void computeLPSArray(char* pat, int M, int* lps) { 
    // length of the previous longest prefix suffix 
    int len = 0; 

    lps[0] = 0; // lps[0] is always 0 

    // the loop calculates lps[i] for i = 1 to M-1 
    int i = 1; 
    while (i < M) { 
        if (pat[i] == pat[len]) { //相等，动态规划
	    len++; 
	    lps[i] = len; 
	    i++; 
	} else { // (pat[i] != pat[len]) 
	    // This is tricky. Consider the example. 
	    // AAACAAAA and i = 7. The idea is similar 
	    // to search step. 
		
	    if (len != 0) { 
	        len = lps[len - 1]; //不等，利用传递性，a=b,b=c,那么a=c

	    // Also, note that we do not increment i here 
	    } else { // if (len == 0)  
	        lps[i] = 0; 
	        i++; 
	    } 
        } 
    } 
} 

// Driver program to test above function 
int main()  { 
    char txt[] = "ABABDABACDABABCABAB"; 
    char pat[] = "ABABCABAB"; 
    KMPSearch(pat, txt); 
    return 0; 
} 

这篇博客写的不错，这两篇结合起来看了好久才看懂KMP，这种东西一般都是意会，頑張って

https://blog.csdn.net/qq_37174526/article/details/90141833