java短_求java程序解释，很短的一段程序

mportjava.util.*;importjava.util.regex.*;importjava.io.*;publicclassyinhe{publicstaticvoidmain(Stringargs[])throwsIOException{BufferedReaderbuf=newBufferedReader(newFileR...

mport java.util.*;

import java.util.regex.*;

import java.io.*;

public class yinhe

{

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(" 文章中单词总数"+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();

}

}

展开