数据结构课程实践3——文本文件单词的检索与计数（源代码）

import java.io.IOException;
import java.nio.file.Paths;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Text {

    /**
     * 朴素模式匹配算法
     * @param array
     * @return
     */
    public static List<Integer> BF(char[] array,char[] model){
        int length=array.length;
        List<Integer> sort=new ArrayList<>();
        for(int i=0;i<length;i++){
            if(array[i]==model[0]&&array[i+1]==model[1]&&array[i+2]==model[2]){
                sort.add(i+1);
            }
        }
        return sort;
    }

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

    /**
     * KMP算法
     * @param
     * @return
     * */
    public static List<Integer> KMP(char[] array,char[] model){
        List<Integer> sort=new ArrayList<>();
        int i=0;
        int j=0;
        int[]next=getNextArray(model);
        while(i<array.length) {
            while (j < model.length) {
                if (j == -1 || array[i] == model[j]) {
                    i++;
                    if(i==array.length)           //判断越界
                        break;
                    j++;
                } else {
                    j = next[j];
                }
            }
            if (j == model.length) {
                sort.add(i - j+1);
                j=-1;
            }
        }
        return sort;
    }

    public static void main(String[] args) throws IOException {
        char[] model={'y','o','u'};
        int count=1;
        Scanner scanner=new Scanner(Paths.get("D:\\ideaProject\\src\\homework\\wb.txt"),"utf-8");
        String text=new String();
        while(scanner.hasNextLine()){
            text+=scanner.nextLine();
        }
        char[] array=text.toCharArray();
        List<Integer> sort=KMP(array, model);
        System.out.println("单词you一共出现了："+sort.size()+"次，"+"分别位于：");
        for(int i=0;i<sort.size();i++) {
            if(sort.get(i)/80>(count-1)){
                count++;
                System.out.println();
            }
            System.out.print("第"+count+"行"+"第"+sort.get(i)%80 + "位"+"\t");
        }
    }
}