这个以前一直看不懂,其实是没能静下心来看,最近刚好买了July的书,强行看下去。
如果有跟我一样觉得学KMP的时候很难懂的道友,劝你们不要放弃,耐心看下去,不要只看书,多自己想想——这个算法的需求是这样,如果是自己来实现的话,会怎么做?然后多在纸上画例子就好了。
下面贴一下自己的实现:
#include <string>
#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
vector<int> calNext(const string& pattern) {
int j = 0, k = -1, pLen = pattern.size();
vector<int> next(pLen, 0);
next[0] = -1;
while (j < pLen-1) {
if (k == -1 || pattern[k] == pattern[j])
next[++j] = ++k;
else
k = next[k];
}
return next;
}
void KMP(const string& text, const string& pattern) {
vector<int> next(calNext(pattern));
int i = 0, j = 0, pLen = pattern.size(), tLen = text.size();
while (j < pLen && i < tLen) {
if (j == -1 || text[i] == pattern[j])
++i, ++j;
else
j = next[j];
}
if (j == pLen)
cout << "Got at " << i-j << ", and the tail text is: " << text.substr(i-j) << endl;
else
cout << "Failed..." << endl;
}
int main() {
string text("Hello everyone, I am jacket, from China. Hello!");
string pattern("Hello");
string pattern2("I am ");
string pattern3("I am KMP");
KMP(text, pattern);
KMP(text, pattern2);
KMP(text, pattern3);
return 0;
}