BF算法以及KMP算法的代码实现

1.BF算法

int BF(const char* str, const char* sub)
{
	assert(*str && *sub);
	if (str == NULL || sub == NULL)
	{
		return -1;
	}
	int lenStr = strlen(str);
	int lenSub = strlen(sub);

	int i = 0;
	int j = 0;

	while (i < lenStr && j < lenSub)
	{
		if (str[i] == sub[j])
		{
			i++;
			j++;
		}
		else
		{
			i = i - j + 1;
			j = 0;
		}
	}
	if (j >= lenSub)
	{
		return i - j;
	}
	return -1;
}//函数返回查找到的数组下标，若查找不到则放回-1

2.KMP算法

#include<stdio.h>
#include<string.h>
#include<assert.h>
#include<malloc.h>

/// <summary>
/// str： 代表主串
/// sub： 代表子串
/// pos： 代表从主串的pos位置开始找
/// </summary>

void GetNext(const char* sub, int* next, int lenSub)
{
	next[0] = -1;
	next[1] = 0;
	int i = 2;//当前i下标
	int k = 0;//前一项的k,此时为i = 1的k
	while(i < lenSub)
	{
		if (k == -1 || sub[i - 1] == sub[k])
		{
			next[i] = k + 1;
			i++;
			k++;
		}
		else
		{
			k = next[k];
		}
	}
}

int KMP(const char* str, const char* sub, int pos)
{
	assert(str && sub);
	int lenStr = strlen(str);
	int lenSub = strlen(sub);
	if (lenStr == 0 || lenSub == 0)
	{
		return -1;
	}
	if (pos < 0 || pos >= lenStr)
	{
		return -1;
	}

	//求next数组
	int *next = (int *)malloc(sizeof(int) * lenSub);
	assert(next);

	GetNext(sub, next, lenSub);

	int i = pos;//遍历主串
	int j = 0;//遍历字串

	while (i < lenStr && j < lenSub)
	{
		if (j == -1 || str[i] == sub[j])
		{
			i++;
			j++;
		}
		else
		{
			j = next[j];
		}
	}
	if (j >= lenSub)
	{
		return i - j;
	}
	return -1;
}