题目3：文本文件单词的检索与计数（代码实现）

文件读取

package English_word;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class Reader {
    private BufferedReader br;
    private File file = new File("D:\\JAVA\\English_Word\\src\\English_word\\word.txt");

    public Reader() {
    }

    public ArrayList<String> reader() {
        ArrayList<String> list = new ArrayList<>();
        //创建字符缓冲输入流
        try {
            br = new BufferedReader(
                    new InputStreamReader(new FileInputStream(file)));
            String line = null;
            while ((line = br.readLine()) != null) {
                list.add(line);
            }
            br.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
        return list;
    }
}

KMP算法

package English_word;


public class KMP {
    public int kmp(String s, String t) {
        if(t.length()>1) {
            char[] s_arr = s.toCharArray();
            char[] t_arr = t.toCharArray();
            int[] next = getNextArray(t_arr);
            int i = 0, j = 0;
            while (i < s_arr.length && j < t_arr.length) {
                if (j == -1 || s_arr[i] == t_arr[j]) {
                    i++;
                    j++;
                } else
                    j = next[j];
            }
            if (j == t_arr.length)
                return i - j;
            else
                return -1;
        }else{
            int flag=s.length()-t.length();
            char[] s_arr2=s.toCharArray();
            char[] t_arr2=s.toCharArray();
            for(char c:s_arr2){
                if(c==t_arr2[0]){
                    flag=-1;
                }
            }
            return flag;
        }
    }

    public static int[] getNextArray(char[] t) {
        int[] next = new int[t.length];
        next[0] = -1;
        next[1] = 0;
        int k;
        for (int j = 2; j < t.length; j++) {
            k = next[j - 1];
            while (k != -1) {
                if (t[j - 1] == t[k]) {
                    next[j] = k + 1;
                    break;
                } else {
                    k = next[k];
                }
                next[j] = 0;
            }
        }
        return next;
    }
}

BF算法

package English_word;


public class BF {

    public int bf(String str1, String match1) {
        int length1 = str1.length();
        int length2 = match1.length();
        int i = 0;
        int j = 0;
        int k = 0;
        char[] str = str1.toCharArray();
        char[] match = match1.toCharArray();
        while (i < length1 && j < length2) {
            if (str[i] == match[j]) {
                i++;
                j++;
            } else {
                k++;
                j = 0;
                i = k;
            }
        }
        if (j == length2) {
            return k;
        } else {
            return -1;
        }
    }
}

主菜单

package English_word;

import java.util.ArrayList;
import java.util.Scanner;

/**
 * @author 橘子
 * @ClassName: IntelliJ IDEA
 * @Description:
 * @date 2021/3/21 15:53
 */
public class English_word_service {
    public ArrayList<String> read() {
        Reader reader = new Reader();
        ArrayList<String> list1 = reader.reader();
        ArrayList<String> list2 = new ArrayList<>();
        for (String s : list1) {
            String student[] = s.split(" ");
            for (int i = 0; i < student.length; i++) {
                list2.add(student[i]);
            }
        }
        return list2;
    }

    public void start() {
        System.out.println("请输入要查找的单词：");
        Scanner sc = new Scanner(System.in);
        String word = sc.next();
        System.out.println("请选择查询方式：");
        System.out.println("1.普通匹配查找查找模式");
        System.out.println("2.KMP查找模式");
        int choice = sc.nextInt();
        switch (choice) {
            case 1:
                bf(word);
                break;
            case 2:
                kmp(word);
                break;
            default:
                System.out.println("无此选项，返回至主菜单。");
                start();
        }
    }

    public void bf(String word) {
        BF Bf = new BF();
        String[] array = new String[3];
        ArrayList<String[]> list1 = new ArrayList<>();
        for (int i = 0; i < read().size(); i++) {
            int n = 0;
            n = Bf.bf(word, read().get(i));
            if (n != -1) {
                array = new String[]{
                        read().get(i),
                        String.valueOf(read().indexOf(word) + 1),
                        String.valueOf(i + 1)};
                list1.add(array);
            }
        }
        System.out.println("共找到字符串" + word + "的子串" + read().size() + "次");
        for (int i = 0; i < read().size(); i++) {
            System.out.println("第" + (i + 1) + "个字串" + list1.get(i)[0] + ":第" + list1.get(i)[1] + "行第" + list1.get(i)[2] + "个单词");
        }
    }

    public void kmp(String word) {
        KMP Kmp = new KMP();
        String[] array = new String[3];
        ArrayList<String[]> list1 = new ArrayList<>();
        for (int i = 0; i < read().size(); i++) {
            int n = 0;
            n = Kmp.kmp(word, read().get(i));
            if (n != -1) {
                array = new String[]{
                        read().get(i),
                        String.valueOf(read().indexOf(word) + 1),
                        String.valueOf(i + 1)};
                list1.add(array);
            }
        }
        System.out.println("共找到字符串" + word + "的子串" + read().size() + "次");
        for (int i = 0; i < read().size(); i++) {
            System.out.println("第" + (i + 1) + "个字串" + list1.get(i)[0] + ":第" + list1.get(i)[1] + "行第" + list1.get(i)[2] + "个单词");
        }
    }
}

主类（main.java）

package English_word;

public class main {
    public static void main(String[] args) {
        English_word_service ews=new English_word_service();
        ews.start();
    }
}