字典树的Java的板子


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();
charu(aString);
String bString=sc.next();
int aa=search(bString);
System.out.println(aa);
}
  public static int aa=(int)(1e5+145);
 public static int[][] trie=new int[aa][26];
 public static int bb=1;
 public static int[] biaoji=new int[aa];
 public static void charu(String a) {
	 int b=a.length();
	 int c=1;
	 int d;
	 for(d=0;d<b;d++) {
		 int e=a.charAt(d)-'a';
		 if(trie[c][e]==0) {
			 bb++;
			 trie[c][e]=bb;
		 }
		 c=trie[c][e];
	 }
	 biaoji[c]++;
 }
 public static int search(String aString) {
	 int a=1;
	 int b=aString.length();
	 int c=0;
	 for(c=0;c<b;c++) {
		 int d=aString.charAt(c)-'a';
		 if(trie[a][d]>0) {
			 a=trie[a][d];
		 }
		 else{
			 return -1;
		 }
	 }
	 return 1;
 }
}

配套习题:

AcWing 142. 前缀统计 - AcWing

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值