BF算法

#include<iostream>
using namespace std;
int bf(char s[],char t[])
{
int i=0;
int j=0;
  while(s[i]!='\0'&&t[j]!='\0')
 if(s[i]==t[j]) {i++;j++;}
 else {i=i-j+1;j=0;}


  if(t[j]=='\0')
 return i-j+1;
  else return 0;
}
int main()
{
char s[]="agajhfjhasgtjfghfjag";
char t[]="jf";
cout<<bf(s,t)<<endl;
return 0;
}