/*
实现strf功能,即在父串中寻找子串首次出现的位置。
//*/
#include <iostream>
#include <iomanip>
#include <limits>
using namespace std;
bool matchsub(char* pchar, char* schar, int pos);
int main()
{
char pchar[] = "asgdfhlsfbjdjghsnvkdnjbfdkhqg";
char schar[] = "hlsf";
int pos = 0;
int psz = sizeof(pchar);
int ssz = sizeof(schar);
while(pos < psz - ssz){
while(pchar[pos] != schar[0]){
++pos;
}
if(pos >= psz - ssz){
cout << "no match!\n";
break;
}else{
if(matchsub(pchar, schar, pos)){
break;
}
}
}
if(pos < psz - ssz){
cout << "index{start from 0 !} of first match : " << pos << endl;
}
return 0;
}
bool matchsub(char* pchar, char* schar, int pos)
{
bool flag = true;
int i = 0;
while(schar[i] != '\0' && pchar[pos+i] != '\0'){
if(pchar[pos+i] != schar[i]){
flag = false;
break;
}
++i;
}
return flag;
}
实现strf功能,即在父串中寻找子串首次出现的位置
最新推荐文章于 2023-05-23 23:24:22 发布