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