mirror of
https://github.com/huihut/interview.git
synced 2025-12-18 21:14:38 +03:00
添加查找算法和SingleProblem
This commit is contained in:
14
Algorithm/BruteForceStringMatch.h
Normal file
14
Algorithm/BruteForceStringMatch.h
Normal file
@@ -0,0 +1,14 @@
|
||||
// 蛮力字符串匹配
|
||||
int BruteForceStringMatch(vector<char>& Total, vector<char>& Part)
|
||||
{
|
||||
int i, j;
|
||||
for (i = 0; i < Total.size() - Part.size(); ++i) {
|
||||
j = 0;
|
||||
while (j < Part.size() && Part[j] == Total[i + j]) {
|
||||
++j;
|
||||
if (j == Part.size())
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
Reference in New Issue
Block a user