题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=2087
题解:
kmp计算不重叠的匹配次数
AC代码:
#include <iostream>
#include <cstring>
using namespace std;
int nxt[10000];
int m , n, ans;
string p , t;
void getnext()
{
nxt[0] = -1;
int i = 0, j = -1;
while(i < m)
{
while(j >= 0 && p[i] != p[j])
{
j = nxt[j];
}
j += 1; i+= 1;
if(p[i] == p[j])
{
nxt[i] = nxt[j];
}
else
{
nxt[i] = j;
}
}
}
int kmp()
{
ans = 0;
int i = 0, j = 0;
while(i < n)
{
while(j >= 0 && t[i] != p[j])
{
j = nxt[j];
}
i += 1;
j += 1;
if(j == m)
{
ans ++;
j = 0;
}
}
return ans;
}
int main()
{
while(cin >> t)
{
if(t == "#")break;
cin >> p;
n = t.size();
m = p.size();
getnext();
int ans = kmp();
cout << ans <<endl;
}
return 0;
}