在字符串中寻找字串第一次出现的位置,返回第一个下标
子串:模式;母串:目标
应用:模糊搜索,文档内容查找
暴力算法&KMP算法
暴力算法:O(n2)
int findPos(char s[], char t[]){
int cnt=0;
int m = strlen(s), n = strlen(t);
int i = 0, j = 0;
while(i<m && j<n){
cnt++;
if(s[i] == t[j]){
i+=1;
j+=1;
}else{
i=i-j+1;
j=0;
}
}
cout<<"count in findPos is:"<<cnt<<endl;
if(j >= n){
return i-n;
}else{
return -1;
}
}
KMP算法:最大公共首尾子串->next数组(手算,计算机算)->改进版nextv数组
void CalcNext(char t[],int next[]){
int len=strlen(t);
if(len>=1)next[0]=-1;
if(len>=2)next[1]=0;
for(int i=2;i<len;i++){
int k=next[i-1];
if(t[i-1]==t[k])next[i]=k+1;
else{
while(t[i-1]!=t[k]&&k!=-1){
k=next[k];
}
next[i]=k+1;
}
}
}
void CalcNextVal(char t[],int next[],int nextval[]){
int len=strlen(t);
if(len>=1)next[0]=-1;
if(len>=2)next[1]=0;
for(int i=2;i<len;i++){
int k=next[i-1];
if(t[i-1]==t[k])next[i]=k+1;
else{
while(t[i-1]!=t[k]&&k!=-1){
k=next[k];
}
next[i]=k+1;
}
}
for(int i=0;i<len;i++){
nextval[i]=next[i];
}
for(int i=1;i<len;i++){
int k=next[i];
if(t[i]==t[k])nextval[i]=nextval[k];
}
}
int findPos_kmp(char s[],char t[],int next[]){
int cnt=0;
int m = strlen(s), n = strlen(t);
int i = 0, j = 0;
while(i<m && j<n){
cnt++;
if(s[i] == t[j]||j==-1){
i+=1;
j+=1;
}else{
j=next[j];
}
}
cout<<"count in findPos_kmp is:"<<cnt<<endl;
if(j >= n){
return i-n;
}else{
return -1;
}
}
主函数
int main(){
char S[max],T[max];
while(cin>>S>>T){
cout<<S<<endl;
cout<<T<<endl;
int lens=strlen(S);
int lent=strlen(T);
cout<<"the length of S and T is "<<lens
<<" and "<<lent<<endl;
int pos=findPos(S,T);
cout<<"findPos:"<<pos<<endl;
cout<<endl;
int next[lent];
CalcNext(T,next);
cout<<"next arry is:";
for(int i=0;i<lent;i++){cout<<next[i]<<" ";}
cout<<endl<<endl;
pos=findPos_kmp(S,T,next);
cout<<"findPos_kmp:"<<pos<<endl;
cout<<endl;
int nextVal[lent+1];
CalcNextVal(T,next,nextVal);
cout<<"nextVal array is:";
for(int i=1;i<lent;i++)cout<<nextVal[i]<<" ";
cout<<endl<<endl;
pos=findPos_kmp(S,T,nextVal);
cout<<"findPos_improved_kmp:"<<pos<<endl;
cout<<endl;
}
return 0;
}