从一个文件中统计字符出现的次数并且进行排序取出前5条

22
22
22
22
22
222
11
22
33
1
4
5
7
8
9
10
11
111
33
44
555
66
77
99
99
110

//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by Fernflower decompiler)
//

package test16;import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.net.URL;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map.Entry;public class TxtTest {public TxtTest() {}public static void txt2String(File file) {HashMap hashMap &＃61; new HashMap();try {
//读取文件BufferedReader br &＃61; new BufferedReader(new FileReader(file));String s &＃61; null;while((s &＃61; br.readLine()) !&＃61; null) {int i &＃61; (new Integer(s)).intValue();if (!hashMap.containsKey(i)) {hashMap.put(i, Integer.valueOf(1));} else {int value &＃61; ((Integer)hashMap.get(i)).intValue();&＃43;&＃43;value;hashMap.put(i, value);}}br.close();} catch (Exception var8) {var8.printStackTrace();}
//排序List> list &＃61; new ArrayList();list.addAll(hashMap.entrySet());Collections.sort(list, new Comparator>() {public int compare(Entry o1, Entry o2) {return ((Integer)o2.getValue()).intValue() - ((Integer)o1.getValue()).intValue();}});

//输出前5行int i &＃61; 0;for(Iterator iterator &＃61; list.iterator(); iterator.hasNext() && i <5; &＃43;&＃43;i) {Entry entry &＃61; (Entry)iterator.next();int key &＃61; ((Integer)entry.getKey()).intValue();int value &＃61; ((Integer)entry.getValue()).intValue();System.out.println(value &＃43; "个 " &＃43; key);}}public static void main(String[] args) {URL url &＃61; Thread.currentThread().getContextClassLoader().getResource("");url.getPath();File file &＃61; new File(url.getPath() &＃43; "test16//errlog");txt2String(file);}
}