HDU 1711 Number Sequence---KMP算法

题目描述
The French author Georges Perec (1936�1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book:

Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…

Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive ‘T’s is not unusual. And they never use spaces.

So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {‘A’, ‘B’, ‘C’, …, ‘Z’} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.

输入描述:

The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

One line with the word W, a string over {‘A’, ‘B’, ‘C’, …, ‘Z’}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).

One line with the text T, a string over {‘A’, ‘B’, ‘C’, …, ‘Z’}, with |W| ≤ |T| ≤ 1,000,000.

输出描述:

For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.

输入例子:

3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN

输出例子:

1
3
0

import java.util.Scanner;

public class Didi {
    public static void main(String[] args) {

        Scanner input=new Scanner(System.in);
        int n=input.nextInt();
        for (int i = 0; i < n; i++) {
            String a=input.next();
            char[] pattern=a.toCharArray();
            //int[] prefix=next(pattern);
            String b=input.next();
            char[] original=b.toCharArray();
            System.out.println(SearchPattern(original, pattern));
        }

    }
    public static int SearchPattern(char[] original,char[] pattern){
        int[] next=next(pattern);
         int j = 0;  
         int count=0;
            for (int i = 0; i < original.length; i++) {  
                while (j > 0 && original[i]!= pattern[j])   
                    j = next[j-1];  
                if (original[i] == pattern[j])  
                    j++;  
                if (j == pattern.length) {  
                    count++;
                    j = next[j-1];
                    //return i-j+1;

                }  
            }  
        return count;
    }
    public static int[] next(char[] pattern){
        int length=pattern.length;
        int[] prefix=new int[length];
        prefix[0]=0;

         for(int i=1; i<length; i++)

         {

             int k=prefix[i-1];

             //不断递归判断是否存在子对称，k=0说明不再有子对称，Pattern[i] != Pattern[k]说明虽然对称，但是对称后面的值和当前的字符值不相等，所以继续递推

             while( pattern[i] != pattern[k]  &&  k!=0 )               

                 k=prefix[k-1];     //继续递归

             if( pattern[i] == pattern[k])//找到了这个子对称，或者是直接继承了前面的对称性，这两种都在前面的基础上++

                  prefix[i]=k+1;

             else

                  prefix[i]=0;       //如果遍历了所有子对称都无效，说明这个新字符不具有对称性，清0

         }
         return prefix;
    }
}