#include<iostream>
#include<string>
using namespace std;
int patternMachting(string pattern1, string pattern2);
int main()
{
string a = "adfghjklso2wj2o2smwk";
string b = "2o";
int index = patternMachting(a, b);
cout << index;
return 0;
}
int patternMachting(string pattern1, string pattern2) {
int i = 0, j = 0;
int key = i;
while (i < pattern1.length() && j < pattern2.length()) {
if (pattern1[i] == pattern2[j]) {
i++;
j++;
}
else {
key++;
i = key;
j = 0;
}
}
if (j >= pattern2.length()) {
return key;
}else{
return 0;
}
}
串的朴素模式匹配C++
最新推荐文章于 2024-05-03 06:46:10 发布