项目三代码

Input

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;

public class Input {
String xml;
String word;
Scanner scanner =new Scanner(System.in);
public void readTXT(){
try{
StringBuffer buffer = new StringBuffer();
BufferedReader bf= new BufferedReader(new FileReader(“D:\学生成绩管理系统数据文件\article.txt”));
String s = null;
while((s = bf.readLine())!=null){
buffer.append(s.trim());
}
xml = buffer.toString();
System.out.println(xml);
}catch (IOException e){
System.out.println(e.getMessage());
}
}
public void start(){
int count;
readTXT();
System.out.println(“请输入要查询的单词”);
word=scanner.next();
count=KMP(xml,word);
if(count==0){
System.out.println(“未找到单词”);
}
else{
System.out.println(“一共找到”+count+“个”);
}
}
public int KMP(String ts, String ps) {
int num=0;
int i=0;
while(i< ts.length())
{
char[] t = ts.toCharArray();
char[] p = ps.toCharArray();
int j = 0; // 模式串的位置
int[] next = getNext(ps);
while (i < t.length && j < p.length) {
if (j == -1 || t[i] == p[j]) { // 当j为-1时，要移动的是i，当然j也要归0
i++;
j++;
} else {
j = next[j]; // j回到指定位置
}
}
if (j == p.length) {
location(i-j,ps);
num++;
}
}
return num;
}
public static int[] getNext(String ps) {
char[] p = ps.toCharArray();
int[] next = new int[p.length];
next[0] = -1;
int j = 0;
int k = -1;
while (j < p.length - 1) {
if (k == -1 || p[j] == p[k]) {
if (p[++j] == p[++k]) { // 当两个字符相等时要跳过
next[j] = next[k];
} else {
next[j] = k;
}
} else {
k = next[k];
}
}
return next;
}
public void location(int x,String word){
int t=x+word.length()-1;
System.out.println(“单词位置：”+x+"~"+t);
}
}

Main

public class Main {
public static void main(String[]args){
Input input=new Input();
input.start();
}
}