统计各个单词出现的次数

最新推荐文章于 2022-11-15 19:30:44 发布

原创最新推荐文章于 2022-11-15 19:30:44 发布 · 4.5k 阅读

4 ·

CC 4.0 BY-SA版权

数据结构/算法专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个简单的Java程序，该程序用于统计给定英文文本中各个单词出现的频率，并将结果输出到控制台。通过对输入文本进行预处理，去除标点符号并转换为小写形式，使用HashMap来记录每个单词的出现次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package test;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;

public class StStringNum {
   /*
   * 统计各个单词出现的次数
   *
   * @param text
   */
   public static void findEnglishNum(String text){
       //找出所有的单词
       String[] array = {".", " ", "?", "!"};
       for (int i = 0; i < array.length; i++) {
           text = text.replace(array[i],",");
       }
       String[] textArray = text.split(",");

       //遍历记录
       Map<String, Integer> map = new HashMap<String, Integer>();
       for (int i = 0; i < textArray.length; i++) {
           String key = textArray[i];
           //转为小写
           String key_l = key.toLowerCase();
           if(!"".equals(key_l)){
               Integer num = map.get(key_l);
               if(num == null || num == 0){
                   map.put(key_l, 1);
               }else if(num > 0){
                   map.put(key_l, num+1);
               }
           }
       }
       //输出到控制台
       System.out.println("各个单词出现的频率为：");
       Iterator<String> iter = map.keySet().iterator();
       while(iter.hasNext()){
           String key = iter.next();
           Integer num = map.get(key);
           System.out.println(key + "\n\t\t" + num + "次\n-------------------");
       }
   }
   public static void main(String[] args) {
       String text = "Welcome welcome to ADempiere, a commons-based peer-production of Open Source ERP Applications. This Wiki is for the global community to contribute and share know-how and domain expertise. We hope you can find as much open information and participate in making it most usable for everyone. This project has a bazaar of Citizens with a Community Council Team which work in theFunctional Team and Technical Team along the Software Development Procedure supported and funded by the foundation ADempiere";

findEnglishNum(text);

}
}