int NORMAL_Find(char * szString1, char *szString2)
{
if(szString1 == NULL || szString2 == NULL)
{
return false;
}
int i = 0;
int j = 0;
for(i = 0; szString1[i] != '\0'; i++)
{
if(szString1[i] == szString2[0])
{
for(j = 0; szString2[j] != '\0'; j++)
{
ncount++;
if(szString1[i+j] != szString2[j])
{
break;
}
}
if(szString2[j] == '\0')
{
return i;
}
}
}
return false;
}
void GetNext(string& s,int *next)
{
int len = s.size();
next[0] = 0;
next[1] = 0;
int i = 1;
while(i < len - 1)
{
int j = next[i];
while(j > 0 && s.at(j) != s.at(i)) j = next[j];
if(s.at(j) == s.at(i)) next[i + 1] = j + 1;
else next[i + 1] = j;
i++;
}
}
int KMP_Find(string& s,string&t)
{
int i=0,j=0;
int n =t.size();
int *next = new int[n];
GetNext(t,next);
for(i = 0; i< n; i++)
{
cout<<"next["<<i<<"] = "<<next[i]<<endl;
}
while(i<s.size()&&j<t.size())
{
if((j == 0)||(s.at(i)==t.at(j)))
{
i++;
j++;
}
else
{
j = next[j];
}
}
if(j==t.size())
{
int index=i-t.size()+1;
cout<<"子串从长串的第"<<index<<"位开始匹配成功!"<<endl;
return index;
}
cout<<"字符串匹配失败!"<<endl;
return 0;
}
//参与比对的字符串
"BBC ABCDAB ABCDABCDABDE"
"ABCDABD"