统计出现频率最高的二元字符（两个字符）的组合

最新推荐文章于 2020-05-25 05:35:45 发布

ninth_spring

最新推荐文章于 2020-05-25 05:35:45 发布

阅读量523

点赞数

分类专栏： java进阶之路

本文链接：https://blog.csdn.net/ninth_spring/article/details/104925035

版权

java进阶之路专栏收录该内容

61 篇文章 2 订阅

订阅专栏

String str = “ystemtakesinordertosolveproblemsbypruningthesystemssearchspaceforinstancebutinordertodetermineateachstepwhichrulesareapplicablethesystemmustmatchthemagainstitscurrentsituationusingcurrenttechniquesthematcherslowsdownasmoreandmorerulesareacquiredsoeachsteptakeslongerandlongerthisectcanoutweighthereductioninthenumberofstepstakensothatthenetresultisaslowdownthishasbeenobservedinseveralrecentsystemsminton1988aetzioni1990tambeetal1990cohen1990ofcoursetheproblemofslowdownfromincreasingmatchcostisnotrestrictedtosystemsinwhichthepurposeofrulesistoreducethenumberofproblemsolvingstepsasystemacquiringnewrulesforanypurposecanslowdowniftherulessignicantlyincreasethematchcostandintuitivelyoneexpectsthatthemoreproductionsthereareinasystemthehigherthetotalmatchcostwillbethethesisofthisresearchisthatwecansolvethisprobleminabroadclassofsystemsbyimprovingthematchalgorithmtheyuseinessenceouraimistoenablethescalingupofthenumberofrulesinproductionsystemsweadvancethestateoftheartinproductionmatchalgorithmsdevelopinganimprovedmatchalgorithmwhoseperformancescaleswellonasignicantlybroaderclassofsystemsthanexistingalgorithmsfurthermorewedemonstratethatbyusingthisimprovedmatchalgorithmwecanreduceoravoidtheutilityprobleminalargeclassofmachinelearningsystems”;

    Map<String, Integer> map = new TreeMap<String, Integer>();
    char[] ch = str.toCharArray();
    for (int i = 0; i < ch.length - 1; i++) {
        map.put(ch[i] + "" + ch[i + 1], map.get(ch[i] + "" + ch[i + 1]) == null ? 1 : map.get(ch[i] + "" + ch[i + 1]) + 1);
    }
    List<Map.Entry<String, Integer>> mapList = new ArrayList<Map.Entry<String, Integer>>(
            map.entrySet());
    Collections.sort(mapList, new Comparator<Map.Entry<String, Integer>>() {
        public int compare(Map.Entry<String, Integer> num1,
                           Map.Entry<String, Integer> num2) {
            return num1.getValue().compareTo(num2.getValue());
        }
    });

    System.out.println(map);
    int temp=0;
    String strMax="";
    for (Map.Entry<String, Integer> mapping : mapList) {

        if(temp<mapping.getValue()){
            temp= mapping.getValue();
           strMax= mapping.getKey();
        }

    }
      System.out.print("出现次数最多的"+strMax + ":共出现" +temp +"次数"）；
      }
}

结果是th 41次