统计一篇给定的 文章中,各个单词出现的次数的算法。用HashMap 来存放出现的单词的次数,Key 是要统计的单词,Value 是单词出现的次数。
最后再按照 Key 的升序排列出来。
import java.util.*;
import java.io.*;
public class CountOccurrenceOfWords {
public static void main(String[] args) throws Exception {
Map hashMap = null;
BufferedReader infile = null;
StringTokenizer st = null;
String filename = "Test.txt";
String string;
String file = null;
//打开一篇文章,名字是 Test.txt .
infile = new BufferedReader(new FileReader(filename));
while ((string = infile.readLine()) != null) {
file += string; //都出整篇文章,存入String中。
}
hashMap = new HashMap();
// 取出文章中的单词,"," "." "!" " "
最后再按照 Key 的升序排列出来。
import java.util.*;
import java.io.*;
public class CountOccurrenceOfWords {
public static void main(String[] args) throws Exception {
Map hashMap = null;
BufferedReader infile = null;
StringTokenizer st = null;
String filename = "Test.txt";
String string;
String file = null;
//打开一篇文章,名字是 Test.txt .
infile = new BufferedReader(new FileReader(filename));
while ((string = infile.readLine()) != null) {
file += string; //都出整篇文章,存入String中。
}
hashMap = new HashMap();
// 取出文章中的单词,"," "." "!" " "