public static void display()throws Exception{
File file=new File(“D:\期末复习01\暑假作业文件夹\shujiawork07_1\src\com\czxy\domain01\wordcount.txt”);
BufferedReader br = new BufferedReader(new FileReader(file));
String line = null;
//定义一个map集合保存单词和单词出现的个数
TreeMap<String,Integer> tm = new TreeMap<String,Integer>();
//读取文件
while((line=br.readLine())!=null){
line.toLowerCase();
String reg1 = "\\s+";
String reg2 ="\\w+";
//将读取的文本进行分割
String str[] = line.split(reg1);
for(String s: str){
if(s.matches(reg2)){
//判断集合中是否已经存在该单词,如果存在则个数加一,否则将单词添加到 //集合中,且个数置为1
if(!tm.containsKey(s)){
tm.put(s,1);
}else{
tm.put(s,tm.get(s)+1);
}
}
}
}
List<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>(tm.entrySet());
Collections.sort(list,new Comparator<Map.Entry<String,Integer>>() {
//降序排序
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
return o2.getValue()-o1.getValue();
}
});
for (Map.Entry<String, Integer> e: list) {
System.out.println(e.getKey()+":"+e.getValue());
}
}