zoukankan      html  css  js  c++  java
  • 实验二

    1.题目:

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

    (2)编写单元测试进行测试;

    (3)用ElcEmma查看代码覆盖率,要求覆盖率达到100%。

    import java.util.ArrayList;
    import java.util.Collections;
    import java.util.Comparator;
    import java.util.HashMap;
    import java.util.List;
    import java.util.Map;
    import java.util.Map.Entry;


    public class demo {

    /**
    * @param args
    */
    public static void main(String[] args) {
    // TODO Auto-generated method stub
    String str = "Hello World My First Unit Test";
    String[] items = str.split(" ");
    Map<String, Integer> map = new HashMap<String, Integer>();
    for (String s : items) {
    if (map.containsKey(s))
    map.put(s, map.get(s) + 1);
    else {
    map.put(s, 1);
    }
    }
    List<Entry<String, Integer>> list = new ArrayList<Entry<String, Integer>>();
    for (Entry<String, Integer> entry : map.entrySet()) {
    list.add(entry);
    }
    Collections.sort(list, new EntryComparator());

    for (Entry<String, Integer> obj : list) {
    System.out.println(obj.getKey() + " " + obj.getValue());
    }
    }
    }

    class EntryComparator implements Comparator<Entry<String, Integer>> {
    public int compare(Entry<String, Integer> o1, Entry<String, Integer> o2) {
    return o1.getValue() > o2.getValue() ? 0 : 1;
    }
    }

    运行结果:

     

    2.题目:

    (1)把一个英语句子中的单词次序颠倒后输出。例如输入“how are you”,输出“you are how”;

    (2)编写单元测试进行测试;

    (3)用ElcEmma查看代码覆盖率,要求覆盖率达到100%


    public class Cai {

    /**
    * @param args
    */
    public static void main(String[] args) {
    // TODO Auto-generated method stub
    String str = "how are you";
    String strs[] = str.split(" ");
    StringBuffer restr = new StringBuffer();
    for(int i = strs.length-1; i >= 0; i--){
    System.out.println(strs[i]);
    restr.append(" "+strs[i]);
    }
    System.out.println("结果:"+restr);
    }
    }

    运行结果:

  • 相关阅读:
    HDU 2072(字符串的流式操作,学习了)
    HDU 1007 Quoit Design(经典最近点对问题)
    HDU1005 Number Sequence(找规律,周期是变化的)
    HDU 1004 Let the Balloon Rise(map的使用)
    ZCMU 2177 Lucky Numbers (easy)
    2018 HNUCM ACM集训队选拔第一场
    HDU 1162Eddy's picture(MST问题)
    HDU 1142 A Walk Through the Forest(dijkstra+记忆化DFS)
    HDU 1198 Farm Irrigation(并查集,自己构造连通条件或者dfs)
    nyoi 42(欧拉回路)
  • 原文地址:https://www.cnblogs.com/clj23/p/5367467.html
Copyright © 2011-2022 走看看