KMP算法的Java的模板

最新推荐文章于 2024-06-14 14:08:37 发布

爱莉我老婆

最新推荐文章于 2024-06-14 14:08:37 发布

阅读量50

点赞数

分类专栏：算法模板文章标签： java 算法

本文链接：https://blog.csdn.net/m0_73862548/article/details/132246881

版权

算法模板专栏收录该内容

12 篇文章 0 订阅

订阅专栏

package qq;
import java.awt.FontFormatException;
import java.io.BufferedReader; 
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.AnnotatedWildcardType;
import java.math.BigInteger;
import java.sql.SQLIntegrityConstraintViolationException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Spliterator.OfPrimitive;
import java.util.function.IntToDoubleFunction;
import java.util.function.LongBinaryOperator;
import java.util.TreeMap;
import java.util.TreeSet;
import javax.management.relation.InvalidRelationTypeException;
import javax.print.attribute.standard.JobMessageFromOperator;
import javax.print.attribute.standard.JobPriority;
import javax.swing.table.TableModel;
import javax.swing.text.TabSet;
public class main {
  public static void main(String[] args) throws IOException  {
Scanner sc=new Scanner(System.in);
BufferedReader br1=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw1=new PrintWriter(System.out);
String aString=sc.next();//主串
String bString=sc.next();//匹配串
getnext1(bString);
int a=KMP(aString, bString, 0);
System.out.println(a);
	}
public static int[] next1=new int[600000];
public static void getnext1(String a) {
	int b=a.length();
	int c=-1;
	int d=0;
	next1[0]=-1;
	while(d<b) {
		if(c==-1||a.charAt(c)==a.charAt(d)) {
			c++;
			d++;
			next1[d]=c;
		}
		else {
			c=next1[c];
		}
	}
}
public static int KMP(String a,String b,int start) {
	int alength=a.length();
	int blength=b.length();
	int c=start;
	int d=0;
	while(c<alength&&d<blength) {
		if(d==-1||a.charAt(c)==b.charAt(d)) {
			c++;
			d++;
		}
		else {
			d=next1[d];
		}
	}
	if(d==blength) {
		return c-d;
	}
	else {
		return -1;
	}
}
}