C++实现字符串之模式匹配（一）

#include <iostream>#include <string>using namespace std;int String_BF(char S[], char T[]){int i = 0, j = 0;while (S[i] != '\0' && T[j]!='\0'){if (S[i] == T[j])                {++i;++j;}else                  \\分别回溯i和j{i = i - j + 1;j = 0;}}if (T[j] == '\0')return (i - j + 1);elsereturn 0;}int _tmain(int argc, _TCHAR* argv[]){char S[] = "acabcaa";char T[] = "abc";int index = String_BF(S, T);cout << index << endl;return 0;}