//KMP算法,时间复杂度O(m+n)
主要解决字符匹配问题,主要思想就是利用next数组保存最长前后相等子缀,避免重复查找,可以参考这个网址的详细解释,很清楚:
https://www.bilibili.com/video/av3246487/
void produce_next(string &pattern, int next[], int len) {
int j = 0;
next[j] = j;
for (int i = 1; i < len; ++i) {
while (j > 0 && pattern[i] != pattern[j])
j = next[j - 1];
if (pattern[i] == pattern[j])
++j;
next[i] = j;
}
}
bool KMP(string str, string pattern,int *index) {
if (str.size() == 0 || pattern.size() == 0)
return false;
int m = str.size(), n = pattern.size();
int *next = new int[n];
produce_next(pattern, next, n);
int j = 0;
for (int i = 0; i < m; ++i) {
while (j > 0 && str[i] != pattern[j])
j = next[j - 1];
if (str[i] == pattern[j])
++j;
if (j == n)
{
*index = i - j + 1;
return true;
}
}
return false;
}