KMP模板和模板题目

package 算法模板;
import java.util.*;
public class KMP {
 public static void prefix_table(char pattern[],int prefix[],int n) {//找到表
  prefix[0] = 0;
  int len = 0;
  int i = 1;
  while(i<n) {
   if(pattern[i] == pattern[len]) {
    len++;
    prefix[i]=len;
    i++;
   }else {
    if(len>0)len=prefix[len-1];
    else {
     prefix[i]=0;
     i++;
    }
   }
  }
 }
 public static void move_prefix_table(int prefix[],int n) {//把表的每一个元素后移动一位
  for(int i=n-1;i>0;i--) {
   prefix[i]=prefix[i-1];
  }
  prefix[0]=-1;
 }
 public static void kmp_search(char text[],char pattern[]) {//kmp搜索
  //System.out.println("0000000000");
  int n=pattern.length;
  int m=text.length;
  int prefix[]=new int [n];
  prefix_table(pattern,prefix,n);
  move_prefix_table(prefix,n); 
  //text[i],len(text)=m
  //pattern[j]  , len(pattern)=n
  int i=0;
  int j=0;
  while(i<m) {
   if(j==n-1&&text[i]==pattern[j]) {
    System.out.println(i-j);
    j=prefix[j];
   }
   if(text[i]==pattern[j]) {
    i++;
    j++;
   }else {
    j=prefix[j];
    if(j==-1) {
     i++;
     j++;
    }
   }
  }
 }
 public static void main(String[] args) {
  Scanner sc=new Scanner(System.in);
  char pattern[]="ABABCABAA".toCharArray();
  char text[]="ABABABCABAABABABAB".toCharArray();
  kmp_search(text,pattern);
  
  /*
  char pattern[]="ABABCABAA".toCharArray();
  int prefix[]=new int [9];
  int n=9;
  prefix_table(pattern,prefix,n);
  move_prefix_table(prefix,n); 
  for(int i=0;i<n;i++) {
   System.out.println(prefix[i]);
  }*/
 }
}

模板题目和题解：C - Cyclic Nacklace HDU - 3746
B - Number Sequence HDU - 1711