编写一个程序,用来统计一段文本中各个单词的出现次数,假设单词不区分大小写
方法一:
package coding;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Set;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Main {
public static void main(String[] args) {
String some = "Some are born great,some achieve greatness,and some have greatness thrust upon them。";
some = some.toLowerCase();//全部默认为小写
String are = "[a-zA-Z]+";
Pattern s = Pattern.compile(are);
Matcher m = s.matcher(some);
HashMap<String, Integer> a = new HashMap<String, Integer>();
while (m.find()) {
String g = m.group();
if(null == a.get(g)){
a.put(g, 1);
}
else {
int i = a.get(g);
a.put(g, i + 1);
}
}
Set<String> set = a.keySet();
Iterator<String> i= set.iterator();
while(i.hasNext()) {