这个自己写的,时间复杂度比较大,不好
int CompareString(string sDest, string str)
{
int nCount = 0;
for (int i = 0; i < strlen(sDest.c_str()); i++)
{
for (int j = 0; j < str.length(); j++)
{
if (sDest.at(i+j) == str.at(j))
{
nCount++;
if (nCount == str.length())
{
return i;
}
}
else
{
nCount = 0;
break;
}
}
}
return -1;
}
KMP算法的讲解:https://www.cnblogs.com/yjiyjige/p/3263858.html
https://blog.csdn.net/v_july_v/article/details/7041827