import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
public class Test44 {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new FileReader("E:/程序设计方法学/第二次上机任务/in.txt"));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter("E:/程序设计方法学/第二次上机任务/out.txt"));
String s;
while ((s = bufferedReader.readLine()) != null) {
Map<String, Integer> map = new TreeMap<String, Integer>();
//创建一个words数组,分割字符串,来统计单词出现的次数
String[] words = s.split("[【】、.。,\"!--;:?\'\\] ]");
for (int i = 0; i < words.length; i++) {
String key = words[i].toLowerCase();
if (key.length() > 0) {
if (!map.containsKey(key)) {
map.put(key, 1);
} else {// 如果不是第一次出现,就把value值++,那么value值是多少就是出现了几次
int value = map.get(key);
value++;
map.put(key, value);
}
}
}
Set<Map.Entry<String, Integer>> entrySet = map.entrySet();
for (Map.Entry<String, Integer> entry : entrySet) {
//System.out.println(entry.getKey() + "---" + entry.getValue());
bufferedWriter.write(entry.getKey() +"---"+ entry.getValue()+"\r\n");
}
bufferedWriter.newLine();
}
// 关闭输入输出流
bufferedReader.close();
bufferedWriter.close();
}
}