查找字符串出现次数最多的字母和次数包括重复最多的情况

最新推荐文章于 2023-08-20 00:11:27 发布

cgc138

最新推荐文章于 2023-08-20 00:11:27 发布

阅读量860

点赞数 1

本文链接：https://blog.csdn.net/cgc138/article/details/86510388

版权

package com.chen;

import static java.lang.System.*;

import java.util.*;

public class Processor {


    public static void main(String[] args)  {
        String s="vsjkkkdkldavhjjjjdaakfdkaijhdfaohshaii";
        String test="bccaa";
        Processor processor=new Processor();
      
       processor.find(s);

    }
     void find(String input){
        Map<Character,Integer>map=new HashMap<>();
        char [] chars=input.toCharArray();
        for (int i=0; i<chars.length;i++){
            char temp=chars[i];
            if (map.get(temp)!=null){
                map.put(temp,map.get(temp)+1);
            }else{
                map.put(temp,1);
            }
        }

        Set<Map.Entry<Character, Integer>> key=map.entrySet();
        Iterator iterator=key.iterator();
        List maxList=new ArrayList();
        char maxChar = 0;
        int maxValue=0;
        while(iterator.hasNext()){
            Map.Entry temp= (Map.Entry) iterator.next();
            char tempKey= (char) temp.getKey();
            int tempValue= (int) temp.getValue();

            if (tempValue>maxValue){
                maxList.add(tempKey);
                maxValue=tempValue;
                maxChar=tempKey;
            }else if (tempValue==maxValue){
                maxList.add(tempKey);
            }
        }

            int index=0;
            for (int i=0;i<maxList.size();i++){
                if (maxList.get(i).equals(maxChar)){
                    index=i;
                    break;
                }
            }
            for (int i=index;i<maxList.size();i++){
                out.println("最多字符："+maxList.get(i)+"--次数："+maxValue);
            }

    }
  
}