BF匹配算法

#include<iostream>
using namespace std;
int BFmatch(string  a,string  b)
{
	//vector<int>a;
	int aleng=a.length();
	int bleng=b.length();
	for(int i=0;i<=aleng-bleng;i++)
	{
		int j=0;
		while(a[i]==b[j]&&j<bleng)
		{
           i++;
           j++;
		}
		if(j==bleng)
			return i-bleng;
		i=i-j+1;
	}
}
int main()
{
	string a = "chengyanghelloworldchengyang,chengyang";
	string b="gyang";
	cout<<BFmatch(a,b);
	system("pause");
}