文本文件单词的检索与计数 代码实现

代码具体内容如下

package com.igeek.algorithm;


    public class KMP_Algorithm {

        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;
        }


        public int kmpMatch(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;
            }
        }
    }
    package com.igeek.dao;

import com.igeek.data.Database;


public class WordDao {
    private Database database;

    public WordDao(Database database) {
        this.database = database;
    }

    public Database getDatabase() {
        return database;
    }
}

package com.igeek.data;

import com.igeek.pojo.Word;

import java.util.ArrayList;


public class Database {
    private Reader reader = new Reader();
    private Word word = new Word();
    private ArrayList<Word> list = new ArrayList<>();

    public Database() {
        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]);
            }
            ArrayList<String> list3 = new ArrayList<>();
            for (String s1 : list2) {
                list3.add(s1);
            }
            list2.clear();
            list.add(new Word(list3));
        }
    }

    public ArrayList<Word> getList() {
        return list;
    }
}
package com.igeek.data;

import java.io.*;
import java.util.ArrayList;


public class Reader {
    private BufferedReader br;
    private File file = new File("D:\\编程\\数据结构实践三\\src\\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;
    }
}
package com.igeek.main;

import com.igeek.data.Database;
import com.igeek.service.WordService;


public class Main {
    public static void main(String[] args) {
        Database database = new Database();
        WordService wordServer = new WordService(database);
        wordServer.start();
    }
}
package com.igeek.pojo;

import java.util.ArrayList;


public class Word {
    private ArrayList<String> list = new ArrayList<>();

    public Word() {
    }

    public Word(ArrayList<String> list) {
        this.list = list;
    }

    public ArrayList<String> getList() {
        return list;
    }

    public void setList(ArrayList<String> list) {
        this.list = list;
    }
}

package com.igeek.service;

import com.igeek.algorithm.KMP_Algorithm;
import com.igeek.dao.WordDao;
import com.igeek.data.Database;
import com.igeek.pojo.Word;

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


public class WordService {
    private Scanner key = new Scanner(System.in);
    private WordDao wordDao;
    private KMP_Algorithm kmp_algorithm = new KMP_Algorithm();


    public WordService(Database database) {
        wordDao = new WordDao(database);
    }

    /**
     * 主菜单
     */
    public void start() {
        System.out.println("请输入您的查找方式:");
        System.out.println("1.单个单词查找");
        System.out.println("2.字符串子串查询");
        System.out.println("3.退出");
        String chooice = key.next();
        switch (chooice) {
            case "1":
                single();
                break;
            case "2":
                substring();
                break;
            case "3":
                System.out.println("谢谢使用");
                break;
            default:
                System.out.println("输入错误,请重新输入");
                start();
        }
    }

    /**
     * 单个单词查找
     */
    public void single() {
        int array[] = new int[2];
        ArrayList<int[]> list = new ArrayList<>();
        System.out.println("请输入您要查找的单词:");
        String s = key.next();
        for (Word word : wordDao.getDatabase().getList()) {
            for (int i = 0; i < word.getList().size(); i++) {
                if (word.getList().get(i).equals(s)) {
                    array = new int[]{wordDao.getDatabase().getList().indexOf(word) + 1, i + 1};
                    list.add(array);
                }
            }
        }
        System.out.println("共找到单词" + s + " " + list.size() + "次");
        for (int i = 0; i < list.size(); i++) {
            System.out.println("第" + (i + 1) + "次:第" + list.get(i)[0] + "行第" + list.get(i)[1] + "个单词");
        }
        System.out.println("输入任意字符回到主菜单");
        String s1 = key.next();
        System.out.println("返回主菜单");
        start();
    }

    /**
     * 字符串子串查询
     */
    public void substring() {
        String[] array = new String[3];
        ArrayList<String[]> list = new ArrayList<>();
        System.out.println("请输入你要查找的字符串:");
        String s = key.next();

        for (Word word : wordDao.getDatabase().getList()) {
            for (int i = 0; i < word.getList().size(); i++) {
                int n;
                    n=kmp_algorithm.kmpMatch(s,word.getList().get(i));

                if (n != -1) {
                    array = new String[]{word.getList().get(i),
                            String.valueOf(wordDao.getDatabase().getList().indexOf(word) + 1),
                            String.valueOf(i + 1)};
                    list.add(array);
                }
            }
        }
        System.out.println("共找到字符串" + s + "的子串" + list.size() + "次");
        for (int i = 0; i < list.size(); i++) {
            System.out.println("第" + (i + 1) + "个字串" + list.get(i)[0] + ":第" + list.get(i)[1] + "行第" + list.get(i)[2] + "个单词");
        }
        System.out.println("输入任意字符回到主菜单");
        String s2 = key.next();
        System.out.println("返回主菜单");
        start();
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值