版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/wingrez/article/details/88086026
#include<cstdio>
#include<cstring>
int brute_force_search(const char *txt, const char *pat){
int N=strlen(txt);
int M=strlen(pat);
for(int i=0;i<=N-M;i++){
int j;
for(j=0;j<M;j++){
if(txt[i+j]!=pat[j])
break;
}
if(j==M)
return i; //找到匹配
}
return N; //未找到匹配
}
int main(){
const char *txt="https://blog.csdn.net/wingrez";
const char *pat="wingrez";
printf("文本:%s\n", txt);
printf("模式:%s\n", pat);
int p=brute_force_search(txt, pat);
if(p==strlen(txt))
printf("未找到匹配\n");
else
printf("在索引%d处找到匹配\n", p);
return 0;
}
#include<cstdio>
#include<cstring>
int brute_force_search(const char *txt, const char *pat){
int i, N=strlen(txt);
int j, M=strlen(pat);
for(i=0, j=0;i<N && j<M; i++){
if(txt[i]==pat[j]) j++;
else { i-=j; j=0; }
}
if(j==M) return i-M; //找到匹配
return N; //未找到匹配
}
int main(){
const char *txt="https://blog.csdn.net/wingrez";
const char *pat="wingrez";
printf("文本:%s\n", txt);
printf("模式:%s\n", pat);
int p=brute_force_search(txt, pat);
if(p==strlen(txt))
printf("未找到匹配\n");
else
printf("在索引%d处找到匹配\n", p);
return 0;
}