题:有一个文本串S,和一个模式串P,现在要查找P在S中的位置
kmp
可以改写用来计算几个前缀相同,可以记与模式串匹配的位置有几个
思路:i文本移动光标,j模式串移动光标,lps记录前头匹配的前缀和下标信息,j=lps[j-1];移动
(建立lps)i模式串移动光标,len模式串匹配的前缀光标,if(len)len=lps[len-1];//减少搜索次数
#include <iostream>
#include <vector>
using namespace std;
// 计算模式字符串的 LPS 数组
void computeLPSArray(string pat, int M, vector<int> &lps) {
int len = 0;
lps[0] = 0;
int i = 1;
while (i < M) {
if (pat[i] == pat[len]) {
len++;
lps[i] = len;
i++;
} else {
if (len != 0) {
len = lps[len - 1];
} else {
lps[i] = 0;
i++;
}
}
}
}
// 使用 KMP 算法在文本字符串中查找模式字符串
void KMPSearch(string pat, string txt) {
int M = pat.size();
int N = txt.size();
vector<int> lps(M);
computeLPSArray(pat, M, lps);
int i = 0;
int j = 0;
while (i < N) {
if (pat[j] == txt[i]) {
j++;
i++;
}
if (j == M) {
cout << "Found pattern at index " << i - j << endl;
j = lps[j - 1];
} else if (i < N && pat[j] != txt[i]) {
if (j != 0) {
j = lps[j - 1];
} else {
i = i + 1;
}
}
}
}
int main() {
string txt = "ABABDABACDABABCABAB";
string pat = "ABABCABAB";
KMPSearch(pat, txt);
return 0;
}
Sunday
思路:shift后滑距离,i为起始点,j为移动光标
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> sundayPreprocess(const string& pattern) {
vector<int> shift(256, pattern.size() + 1);
for (int i = 0; i < pattern.size(); ++i) {
shift[pattern[i]] = pattern.size() - i;
}
return shift;
}
int sundaySearch(const string& text, const string& pattern) {
int n = text.size();
int m = pattern.size();
if (n < m) return -1;
vector<int> shift = sundayPreprocess(pattern);
int i = 0;
while (i <= n - m) {
int j = 0;
while (j < m && text[i + j] == pattern[j]) {
j++;
}
if (j == m) return i;
if (i + m >= n) break;
i += shift[text[i + m]];//从i光标到pattern整个长度的text范围都没有符合条件的开始位置
}
return -1;
}
int main() {
string text = "ABCABDABACDABABCABAB";
string pattern = "ABDAB";
int pos = sundaySearch(text, pattern);
if (pos != -1) {
cout << "Pattern found at index: " << pos << endl;
} else {
cout << "Pattern not found in the text." << endl;
}
return 0;
}