編寫一個程序,統計在一段文本中單詞的出現次數,然后按照單詞的字典序顯示這些單詞以及它們對應的次數。
文本段落示例:
Good morning. Have a good class.
Have a good visit. Have fun!
Good morning. Have a good class.
Have a good visit. Have fun!
import java.util.*; import java.io.*; public class Exercise3 { public static void main(String[] args) throws Exception { TreeMap<String,Integer> tm=new TreeMap(); BufferedReader br = new BufferedReader(new FileReader("English.txt")); String line = null; while ((line = br.readLine()) != null) { String[] words = line.split(" |\\.|\\!"); for (int i = 0; i < words.length; i++) { String word=words[i]; if (tm.containsKey(word)) { int value1=tm.get(word); value1++; tm.put(word,value1); } else { tm.put(word,1); } //System.out.println(words[i]+'\n'); } } br.close(); Set keySet=tm.keySet(); Iterator it2=keySet.iterator(); it2.next(); while (it2.hasNext()) { Object key=it2.next(); Object value=tm.get(key); System.out.println(key+":"+value); } } }