prefix数组
匹配机制
算法代码
#include <iostream>
#include <string>
#include <vector>
using namespace std;
//求prefix[]
void prefix_table(string pattern, int prefix[], int n){
prefix[0] = 0;
int len = 0;
int i=1;
while(i<n){
if(pattern[i] == pattern[len]){//相等
len++;
prefix[i] = len;
i++;
}else{//不等
if(len>0)
len = prefix[len-1];
else{
prefix[i] = len;
i++;
}
}
}
}
//调整prefix
void move_prefix(int prefix[], int n){
for(int i=n-1; i>0; i--){
prefix[i] = prefix[i-1];
}
prefix[0] = -1;
}
//KMP查找
void kmp_search(string text, string pattern){
int m = text.size(), n = pattern.size();
int prefix[9] = {0};
prefix_table(pattern, prefix, n);
move_prefix(prefix, n);
int i = 0; //text : i
int j = 0; //pattern : j
while(i<m){
if(j == n-1 && text[i] == pattern[j]){
cout<<"found pattern at : "<<i-j<<endl; //匹配完整,输出
j = prefix[j]; //继续下一轮
}
if(text[i] == pattern[j]){
i++;
j++;
}else{
j = prefix[j];//不匹配时让prefix[j]继续和text[i]匹配
if(j == -1){ //当prefix[j] == -1
i++;
j++;
}
}
}
}
int main(){
string pattern = "ABABCABAA";
string text = "ABABABABABABCABAABABCABAABC";
// 0 8 16
kmp_search(text, pattern);
/* //test
for(int i=0; i<n; i++){
cout<<prefix[i]<<" ";
}*/
cout<<endl;
}
代码详解
图片来自下面连接的b站UP主
讲解视频