import java.util.*;
import java.util.regex.*;
import java.io.*;
public class UserTreeMap{

public static void main(String args[]) throws IOException{
 
  BufferedReader buf=new BufferedReader(new FileReader("english.txt"));
  System.out.println("Read under this dir English.txt");
  StringBuffer sbuf=new StringBuffer();
  String line=null;
  while((line=buf.readLine())!=null){
  sbuf.append(line);
  }
  buf.close();
  Pattern expression=Pattern.compile("[a-zA-Z]+");
  String string1=sbuf.toString().toLowerCase();
  Matcher matcher=expression.matcher(string1);
  TreeMap myTreeMap=new TreeMap();
  int n=0;
  Object word=null;
  Object num=null;
  while(matcher.find()){
  word=matcher.group();
  n++;
  if(myTreeMap.containsKey(word)){
    num=myTreeMap.get(word);
    Integer count=(Integer)num;
    myTreeMap.put(word,new Integer(count.intValue()+1));
  }
  else
  {
    myTreeMap.put(word,new Integer(1));
  }
  }
  System.out.println("统计分析如下:");
  System.out.println(""t 文章中单词总数为:"+n+"个");
  System.out.println("具体信息查看当前目录的Result.txt文件");
  BufferedWriter bufw=new BufferedWriter(new FileWriter("result.txt"));
  Iterator iter=myTreeMap.keySet().iterator();
  Object key=null;
  while(iter.hasNext()){
  key=iter.next();
  bufw.write((String)key+":"+myTreeMap.get(key));
  bufw.newLine();
  }
  bufw.write("english.txt单词总数为"+n+"¸ö");
  bufw.newLine();
  bufw.write("english.txt不同单词"+myTreeMap.size()+"个");
  bufw.close();
}
}

相关文章:

  • 2022-01-24
  • 2022-12-23
  • 2021-11-17
  • 2022-12-23
  • 2022-12-23
  • 2021-07-20
  • 2021-11-30
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2021-05-23
  • 2021-07-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
相关资源
相似解决方案