计算单词个数和单词重复的次数

public static void main(String[] args){
       // 读文件
       BufferReader bufferReader = new BufferReader(new FileReader("包含单词的文件"));
       StringBuffer stringBuffer = new StringBuffer();
       String line = null;
       while ((line = bufferReader.readLine()) != null) {
           stringBuffer.append(line);
       }
       bufferReader.close();
       Pattern expression = Pattern.compile("[a-zA-Z]+");
       String str = stringBuffer.toString().toLowerCase();
       Matcher matcher = expression.matcher(str);
       
       TreeMap<Object, Integer> myTreeMap = new TreeMap<Object,Integer>();
       int n = 0;
       Object word = null;
       int num = 0;
       while (matcher.find()) {
              word = matcher.group();
              n++;
              if (myTreeMap.containKeys(word)) {
                    num = myTreeMap.get(word); 
                    myTreeMap.put(word, new Integer(num+1));
              } else {
                    myTreeMap.put(word, new Integer(n));
              }
       }
       System.out.println("XX文件中包含"+ n + "个单词");
       // 输出每个单词重复的次数
      Iterator<Object> iterator = myTreeMap.keySet().iterator();
      Object key = null;
      while (iterator.hasNext()) {
             key = iterator.next();
             System.out.println(key + ":" + myTreeMap.get(key));
      }
}