文本文件单词的检索与计数——项目实现

最新推荐文章于 2021-03-17 20:09:11 发布

qq_quiet

最新推荐文章于 2021-03-17 20:09:11 发布

阅读量347

点赞数

本文链接：https://blog.csdn.net/qq_53434590/article/details/114495412

版权

本文档介绍了如何使用C++实现一个简单的项目，通过BufferedReader逐行读取文本文件，并统计指定单词的出现次数，同时展示了如何创建CountWords类进行单词搜索和打印结果。阅读者将学习到文件操作、字符串处理和基本的数据结构应用。

摘要由CSDN通过智能技术生成

文本文件单词的检索与计数——项目实现

文本文件单词的检索与计数——项目实现
- 源代码
- 运行结果

文本文件单词的检索与计数——项目实现

源代码

package FindWords;

import java.io.BufferedReader;
import java.io.FileReader;

public class test {
    public static void main(String[] args) throws Exception {
        //读取文件信息
        StringBuffer re = new StringBuffer();//字符缓冲区
        BufferedReader br = new BufferedReader(new FileReader("C:\\Users\\13959\\Desktop\\words message.txt"));
        String txt = br.readLine();
        int lines = 0;
        int[] lengthStorage = new int[100];
        lengthStorage[0] = 0;
        while (txt != null) {
            lines++;
            lengthStorage[lines] = lengthStorage[lines - 1] + txt.length();
            re.append(txt);
            txt = br.readLine();
        }
        txt = re.toString();
        System.out.println("请输入需要查找的单词：");
        Scanner scanner=new Scanner(System.in);
        String str=scanner.next();
        CountWords CountWords = new CountWords(str);
        CountWords.search(txt);
        CountWords.print(lengthStorage, lines);
    }
}

package FindWords;

import java.util.ArrayList;
import java.util.List;

public class CountWords {
    private String target;
    private int[] next;
    private int[] nextval;
    static List<Integer> list;

    public CountWords(String target) {
        this.target = target;
        int n = target.length();
        next = new int[n];
        nextval = new int[n];
        list = new ArrayList<>();
        find();
        compare();
    }

    public void find() {
        int n = target.length();
        if (n == 0) return;
        if (n == 1) {
            next[0] = -1;
            return;
        }
        if (n == 2) {
            next[0] = -1;
            next[1] = 0;
            return;
        }
        next[0] = -1;
        next[1] = 0;
        for (int i = 2; i < n; i++) {
            int maxlength = 0;
            for (int j = 1; j < i; j++) {
                String s1;
                String s2;
                s1 = target.substring(0, j);
                s2 = target.substring(n - j, n);
                if (s1.equals(s2)) maxlength = j;
            }
            next[i] = maxlength;
        }
    }

    public void compare() {
        int n = target.length();
        nextval[0] = -1;
        for (int i = 1; i < n; i++) {
            if (target.charAt(i) == target.charAt(next[i]))
                nextval[i] = nextval[nextval[i]];
            else
                nextval[i] = next[i];
        }
    }

    public void search(String txt) {
        int n = txt.length();
        int m = target.length();
        int i = 0, j = 0;
        while (i < n) {
            if (j == -1 || txt.charAt(i) == target.charAt(j)) {
                i++;
                j++;
            } else {
                j = next[j];
            }
            if (j == m) {
                list.add(i - m);
                j = 0;
            }
        }
    }

    public void print(int[] arr, int lines) {
        int[] seat = new int[100];//行数
        int[] number = new int[100];//第几个
        int n = list.size();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < lines; j++) {
                if (list.get(i) < arr[j + 1]) {
                    seat[i] = j + 1;
                    number[i] = list.get(i) + 1 - arr[j];
                    break;
                }
            }
        }
        System.out.println("出现的总次数：" + n + "\n");
        for (int i = 0; i < n; i++) {
            System.out.println("第" + (i + 1) + "次出现的位置：" + "第" + seat[i] + "行 " + " 第" + number[i] + "列" + "\t");
        }
    }
}