#include <iostream>
using namespace std;
int FrontRearIndex(const string &T,const string &P,int pos=0)
{
int startPos=pos;
while(startPos<T.length()-P.length()+1)
{
int front=0,rear=P.length()-1;
while(front<=rear)
{
if(T[startPos+front]!=P[front]||T[startPos+rear]!=P[rear])
break;
else
{
front++;
rear--;
}
}
if(front>rear)
return startPos;
else
++startPos;
}
return -1;
}
int main()
{
cout<<FrontRearIndex("abaabab","abab",0)<<endl;
return 0;
}
首尾字符匹配算法
最新推荐文章于 2023-09-21 22:18:03 发布