剪花布条

           要注意的就是匹配中拉个i=i-1那一步操作。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n, m, sum;
int nextn[1005];
char a[1005], b[1005];
int getne()
{
	int i = 0, j = -1;
	nextn[0] = -1;
	while (i<m)
	{
		if (j == -1 || b[i] == b[j])
		{
			i++;
			j++;
			if (b[i] == b[j])
				nextn[i] = nextn[j];
			else nextn[i] = j;
		}
		else j = nextn[j];
	}
	return 0;
}
int kmp()
{
	int i = 0, j = 0, t;
	sum = 0;
	while (i<n&&j<m)
	{
		if (j == -1 || a[i] == b[j])
		{
			i++;
			j++;
		}
		else j = nextn[j];
		if (j >= m)
		{
			sum++;
			i = i - 1;
			j = -1;
		}
	}
	return sum;
}
int main()
{
	int i;
	while (cin>>a)
	{
		if (a[0] == '#')
			break;
		cin >> b;
		n = strlen(a);
		m = strlen(b);
		getne();
		cout << kmp() << endl;
	}
	return 0;
}