KMP算法

void getNext(const char *T, int next[])
{
	int j = 0, k = -1;
	next[0] = -1;
	
	while (T[j] != '\0')
	{
		if (k == -1 || T[j] == T[k])
		{
			j++;
			k++;
			if (T[j] != T[k])
			{
				next[j] = k;
			}
			else
			{
				next[j] = next[k];
			}
		}
		else
		{
			k = next[k];
		}
	}
}

int myKMP(const char *src, const char *pat)
{
	if (src == NULL || pat == NULL || src[0] == '\0' || pat[0] == '\0')
		return -1;
	
	int len = 0;
	const char *pp = pat;
	while (*pp != '\0')
	{
		len++;
		pp++;
	}
	
	int *next = new int[len + 1];
	
	getNext(pat, next);
	
	int index = 0, i = 0, j = 0;
	while(src[i] != '\0' && pat[j] != '\0')
	{
		if (src[i] == pat[j])
		{
			i++;
			j++;
		}
		else
		{
			index += (j - next[j]);
			if (next[j] != -1)
			{
				j = next[j];
			}
			else
			{
				j = 0;
				i++;
			}
		}
	}
	
	delete []next;
	
	if (pat[j] == '\0')
		return index;
	else
		return -1;
}