字符串匹配之KMP算法

#include "stdafx.h"
#include <iostream>
#include <vector>
#include<stack>
#include<algorithm>
using namespace std;

vector<int> getNext(string p) {
//优化版本
	int n = p.size(), k = -1, j = 0;
	vector<int> next(n, 0);
	next[0] = -1;
	while (j < n - 1) {
		if (k == -1 || p[j] == p[k]) {
			++k; ++j;
			next[j] = (p[j] != p[k]) ? k : next[k];
		}
		else {
			k = next[k];
		}
	}
	return next;
}


vector<int> getNext(string p) {
//未优化版本
	int n = p.size(), k = -1, j = 0;
	vector<int> next(n, 0);
	next[0] = -1;

	while (j < n - 1) {
		if (k == -1 || p[j] == p[k]) {
			++k; ++j;
			next[j] = k;
		}
		else {
			k = next[k];
		}
	}
	return next;

}


int kmp(string s, string p) {
	int m = s.size(), n = p.size(), i = 0, j = 0;
	vector<int> next = getNext(p);
	while (i < m && j < n) {
		if (j == -1 || s[i] == p[j]) {
			++i; ++j;
		}
		else {
			j = next[j];
		}
	}
 
	return (j == n) ? i - j : -1;
}

int main() {
	cout << kmp("BBC_ABCDAB_ABCDABCDABDE", "ABCDABD") << endl; // Output: 15
}