字符串匹配（KMP）算法

#include<iostream>
#include<vector>
#include<string>
using namespace std;

void get_nextval(string t, vector<int>& nextval)
{
	int i = 0;
	int j = -1;
	nextval[0] = -1;
	while (i < t.size() - 1)
	{
		if (j == -1 || t[i] == t[j])
		{
			i++;
			j++;
			if (t[i] == t[j])
			{
				nextval[i] = nextval[j];

			}
			else
				nextval[i] = j;
		}
		else
		{
			j = nextval[j];
		}
	}
}
int index_kmp(string s, string t)
{
	int i = 0;
	int j = 0;
	int len = t.size();
	
	vector<int>nextval(t.size());
	get_nextval(t, nextval);
	while (i < (s.size()) && j<len)
	{
		if (j == -1 || s[i] == t[j])
		{
			i++;
			j++;
		}
		else
		{
			j = nextval[j];
		}
	}
	if (j >= t.size())
	{
		return i - t.size();
	}
	else
		return -1;
}
int main()
{
	string s = "aaabba";
	string t = "bba";
	int pos = index_kmp(s, t);
	cout <<pos<< endl;
	system("pause");
	return 0;
}