基于next数组的KMP源码

对于书上介绍的KMP算法的源码，如有问题欢迎评论指出。

#include <iostream>
#include <string>

using namespace std;

void getNext(char *s, int *next)
{
	int sLen = strlen(s);
	int j = 0;
	int k = -1;
	next[0] = -1;
	while(j < sLen - 1)
	{
		if(s[j] == s[k] || k == -1)
		{
			++j;
			++k;
			if(s[j] == s[k])
				next[j] = k;
			else
				next[j] = next[k];  //再次进行的递归
		}
		else
			k = next[k];
	}
}

int KMPSearch(char *p,char *s,int *next)
{
	int pLen = strlen(p);
	int sLen = strlen(s);
	int i = 0;
	int j = 0;
	while(i < sLen && j < pLen)
	{
		if(s[i] == p[j] || j == -1)
		{
			++i;
			++j;
		}
		else
			j = next[j];
	}
	if(j == pLen)
		return i - j + 1;
	else
		return -1;
}

int main()
{
	char *s = "abcdfacdeabdfdsa";
	char *p = "abd";
	int next[50];
	getNext(s,next);
	cout << KMPSearch(p,s,next) << endl;
	getchar();
	return 0;
}