KMP

题目描述

    Finding all occurrences of a pattern in a text is a problem that arises frequently in text-editing programs.     Typically,the text is a document being edited,and the pattern searched for is a particular word supplied by the user.       We assume that the text is an array T[1..n] of length n and that the pattern is an array P[1..m] of length m<=n.We further assume that the elements of P and  T are all alphabets(∑={a,b...,z}).The character arrays P and T are often called strings of characters.       We say that pattern P occurs with shift s in the text T if 0<=s<=n and T[s+1..s+m] = P[1..m](that is if T[s+j]=P[j],for 1<=j<=m).       If P occurs with shift s in T,then we call s a valid shift;otherwise,we calls a invalid shift.      Your task is to calculate the number of vald shifts for the given text T and p attern P.

输入描述:

   For each case, there are two strings T and P on a line,separated by a single space.You may assume both the length of T and P will not exceed 10^6.

输出描述:

    You should output a number on a separate line,which indicates the number of valid shifts for the given text T and pattern P.

示例1

输入

复制

abababab abab

输出

复制

3

#include<iostream>
using namespace std;
string a,b;
int len1,len2;
int next[10000];
void get(string b,int len2)
{//在求next数组的时候，相当于模式串自己在跟自己匹配。
    int i=0,j=-1;
    next[0]=-1;
    while(i<len2)//i主串
    {
       while(j!=-1&&b[i]!=b[j])j=next[j];
       if(b[++i]==b[++j])
          next[i]=next[j];
       else next[i]=j;
    }
}
int KMP(string a,int len1,string b,int len2)
{
    get(b,len2);
    int i=0,j=0;
    int ans=0;
    while(i<len1)
    {
        while(j!=-1&&a[i]!=b[j])j=next[j];
        i++;
        j++;
        if(j>=len2)
        {
            j=next[j];
            ans++;
        }
    }
    return ans;
}
int main()
{
    while(cin>>a>>b)
    {
        int ans=KMP(a,a.size(),b,b.size());
        cout<<ans<<endl;
    }
    return 0;
}