- 核心数组:
next[i]: T[i]…T[m - 1]与T的最长相同前缀长度;
extend[i]: S[i]…S[n - 1]与T的最长相同前缀长度。 - 个人理解:每次找到可以匹配的一串字符,就将其展开(a,p),在依次枚举i。而当访问超出p时,更新区间。
- 代码1
#include <iostream>
#include <string>
using namespace std;
void GetNext(string & T, int & m, int next[])
{
int a = 0, p = 0;
next[0] = m;
for (int i = 1; i < m; i++)
{
if (i >= p || i + next[i - a] >= p)
{
if (i >= p)
p = i;
while (p < m && T[p] == T[p - i])
p++;
next[i] = p - i;
a = i; //理解了很久
}
else
next[i] = next[i - a];
}
}
void GetExtend(string & S, int & n, string & T, int & m, int extend[], int next[])
{
int a = 0, p = 0;
GetNext(T, m, next);
for (int i = 0; i < n; i++)
{
if (i >= p || i + next[i - a] >= p) // i >= p 的作用:举个典型例子,S 和 T 无一字符相同
{
if (i >= p)
p = i;
while (p < n && p - i < m && S[p] == T[p - i])
p++;
extend[i] = p - i;
a = i;
}
else
extend[i] = next[i - a];
}
}
int main()
{
freopen("w.in","r",stdin);
int next[100];
int extend[100];
string S, T;
int n, m;
while (cin >> S >> T)
{
n = S.size();
m = T.size();
GetExtend(S, n, T, m, extend, next);
// 打印 next
cout << "next: ";
for (int i = 0; i < m; i++)
cout << next[i] << " ";
// 打印 extend
cout << "\nextend: ";
for (int i = 0; i < n; i++)
cout << extend[i] << " ";
cout << endl << endl;
}
return 0;
}
4.p是永远不会变小的,而每次更新是基于i进行的,所以a要更新为i