zoukankan      html  css  js  c++  java
  • 写一个程序,用于分析一个字符串中各个单词出现的频率,并将单词和它出现的频率输出显示。(单词之间用空格隔开,如“Hello World My First Unit Test”)

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


    public class Test {

    public void index() {

    String strWords = "Hello World My First Unit Test";

    String[] words_Array = strWords.split(" ");

    Map<String,Integer> words_Map=new HashMap<String, Integer>();

    int arrLength = words_Array.length;

    for(int i=0;i<arrLength;i++){

    if(!words_Map.containsKey(words_Array[i])){

    words_Map.put(words_Array[i], 1);

    System.out.println(words_Array[i]);

    System.out.println("出现");

    System.out.println(words_Map.put(words_Array[i], 1));

    System.out.println("次");

    }else{

    int currentNum = words_Map.get(words_Array[i])+1;

    words_Map.remove(words_Array[i]);

    words_Map.put(words_Array[i], currentNum);

    System.out.println(words_Array[i]);

    System.out.println("出现");

    System.out.println(words_Map.put(words_Array[i], currentNum));

    System.out.println("次");

    }

    }

    }

    }

  • 相关阅读:
    Poj2033
    CodeForces 540
    CodeForces 548
    LeetCode#2 Add Two Numbers
    CodeForces 544A
    POJ 2431Expedition
    HLG1116-选美大赛
    清华学堂 列车调度(Train)
    清华学堂 LightHouse
    清华学堂 Range
  • 原文地址:https://www.cnblogs.com/cysking/p/5319421.html
Copyright © 2011-2022 走看看