一个另辟蹊径的答案,无聊随便想想(不喜勿喷)。仅仅查询最多次数的字母和次数

public static void main(String[] args) {
        String t = "egreghergdsbhrtehresgdsagewyeegeeeesgesgewgesrg";
        Map<String,Object> map = new HashMap<String, Object>();
        map.put("sum", 0);
        map.put("char", t.charAt(0)+"");
        sum(map,t);
        System.out.println(map.get("char")+"========"+map.get("sum"));
    }
    
    public static void sum(Map<String,Object> map,String t){
        if(t.length()==0){
            return;
        }
        String b = t.charAt(0)+"";
        int old = t.length();
        t = t.replaceAll(t.charAt(0)+"", "");
        int j = old - t.length();
        if(j>(Integer)map.get("sum")){
            map.put("sum", j);
            map.put("char", b);
        }
        sum(map,t);
    }

 

posted on 2019-08-09 15:30  山丘--  阅读(90)  评论(0)    收藏  举报