给定一个词典W（保证词典不重复），输入一句文本S，使用词典进行分词，如果能够进行分词，输出Yes，否则输出No

最新推荐文章于 2020-03-12 18:29:18 发布

zhicheng_gogogo

最新推荐文章于 2020-03-12 18:29:18 发布

阅读量247

点赞数

分类专栏： java web 文章标签： Java

本文链接：https://blog.csdn.net/zhicheng_angle/article/details/102572488

版权

java web 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

package com.zhicheng.itcast;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class XieChengFenCi {

   public static void main(String [] args) {
       boolean flag = false;
       boolean flag2 = false;
       List<String> Wlist = new ArrayList<>();
       int max = 0;
       Scanner scanner = new Scanner(System.in);
       String W = scanner.nextLine();
       String S = scanner.nextLine();
       StringBuilder SstringBuilder = new StringBuilder(S);
//       System.out.println("stringBuilder+"+SstringBuilder);
//       System.out.println("Words: "+W);
//       System.out.println("Sentences: "+S);
       String[] arr = W.split("，");
       for (int i = 0; i < arr.length; i++) {
           Wlist.add(arr[i]);
           //System.out.println(arr[i]);
           if (max < arr[i].length()) {
               max = arr[i].length();
           }
       }
       //System.out.println("max length of the Words= " + max);
       //System.out.println(Wlist);
       boolean [] dp = new boolean[S.length()];
       for(int i = 0; i < S.length(); i++) {
           for(int j = 0; j < max; j++) {
               for (int k = 0; k <= j; k++) {
                   //使用滑窗进行匹配，最大匹配长度为字典里面元素的最大值
                   if (Wlist.contains(S.substring(Math.max(0, i-j+k), Math.min(i+k+1, S.length())))) {
                       //System.out.println(S.substring(Math.max(0, i-j+k), Math.min(i+k+1, S.length())));
                       dp[i] = true;
                       //System.out.println(i+"dp[i]"+dp[i]);
                       break;
                   }
               }
           }
       }
       for (int i = 0; i < dp.length; i++) {
           if (dp[i] == false) {
               System.out.println("No");
               flag2 = true;
               break;
           }
       }
       if (!flag2) {
           System.out.println("Yes");
       }

   }
}