#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
string zhu="asdzabcdoiwqhryiwrfdgsfdfdshgdsgfsdgsfgfdggfjdjfdetmxcbmv";
int search(string p){
int i=0,j=0,pos=0;
while(i<zhu.size()){
pos=i;
if(zhu[i]==p[j]){
while(j<p.size()&&i<zhu.size()){
j++;
i++;
if(zhu[i]!=p[j]){
i=pos+1;
j=0;
break;
}
if(j==p.size()-1) return pos;
}
}else{
i++;
}
}
return -1;
}
int main(){
int i,j,m,n;
string pattern;
cin>>pattern;
printf("%d\n",search(pattern));
return 0;
}
简单模式串匹配算法
最新推荐文章于 2020-07-06 15:57:45 发布